Results 221 to 230 of about 27,704 (259)
Some of the next articles are maybe not open access.

SSOR-like methods for saddle point problems

International Journal of Computer Mathematics, 2009
Saddle point problems arise in a wide variety of applications in computational and engineering. The aim of this paper is to present a SSOR-like iterative method for solving the saddle point problems. Here the convergence of this method is studied and specifically, the spectral radius and the optimal relaxation parameter of the iteration matrix are also
Bing Zheng, Ke Wang, Yujiang Wu
openaire   +3 more sources

Improved RGF method to find saddle points

Journal of Computational Chemistry, 2002
AbstractThe predictor‐corrector method for following a reduced gradient (RGF) to determine saddle points [Quapp, W. et al., J Comput Chem 1998, 19, 1087] is further accelerated by a modification allowing an implied corrector step per predictor but almost without additional costs.
Michael Hirsch 0003, Wolfgang Quapp
openaire   +4 more sources

The saddle-point method

2010
The saddle point method is an asymptotic method to calculate integrals of the type $$ \int_{-\infty}^{\infty} e^{n\phi(x)} dx $$ (32.1) for large n. If the function o(x) has a maximum at x 0 , then the integrand also has a maximum there which becomes very sharp for large n.
Philipp Scherer, Sighart F. Fischer
  +4 more sources

Accelerated Methods for Saddle-Point Problem

Computational Mathematics and Mathematical Physics, 2020
The paper deals with a class of smooth convex-concave saddle-point optimization problems with a special structure arising, e.g., in image processing and when solving various inverse problems. It is proposed to reduce the considered saddle-point problems to a combination of auxiliary minimization problems with smooth strongly convex functions that are ...
Alkousa, M. S.   +4 more
openaire   +3 more sources

Subgradient Methods for Saddle-Point Problems

Journal of Optimization Theory and Applications, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelia Nedic, Asuman E. Ozdaglar
openaire   +3 more sources

An Interior-Point Method for a Class of Saddle-Point Problems

Journal of Optimization Theory and Applications, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halldórsson, B. V., Tütüncü, R. H.
openaire   +1 more source

A climbing string method for saddle point search

The Journal of Chemical Physics, 2013
The string method originally proposed for the computation of minimum energy paths (MEPs) is modified to find saddle points around a given minimum on a potential energy landscape using the location of this minimum as only input. In the modified method the string is evolved by gradient flow in path space, with one of its end points fixed at the minimum ...
Ren, W., Vanden-Eijnden, E.
openaire   +2 more sources

Distributed subgradient methods for saddle-point problems

2015 54th IEEE Conference on Decision and Control (CDC), 2015
We present provably correct distributed subgradient methods for general min-max problems with agreement constraints on a subset of the arguments of both the convex and concave parts. Applications include separable constrained minimization problems where each constraint is a sum of convex functions of local variables for the agents.
David Mateos-Nunez, Jorge Cortés 0001
openaire   +2 more sources

Modified Uzawa methods for saddle point problems

Applied Mathematics and Computation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen Li, Xin-Hui Shao, Changjun Li
openaire   +3 more sources

Home - About - Disclaimer - Privacy