Results 211 to 220 of about 10,389,003 (244)
Some of the next articles are maybe not open access.
Modifications in Optimization and Saddle Point Problems
SIAM Journal on Control and Optimization, 1979A general optimization problem of finding ${\operatorname{Inf}}\{ f(x)\mid x \in A\} $ is modified with a sequence of functions $(H_n )$, $n \in \mathbb{N}$ to yield the problems ${\operatorname{Inf}}\{ f(x) + H_n (x)\mid x \in A\} $. The properties of convergence are studied in two general classes of modifications, These results are applied to modify ...
openaire +2 more sources
Saddle Point Seeking for Convex Optimization Problems
IFAC Proceedings Volumes, 2013Abstract In this paper, we consider convex optimization problems with constraints. By combining the idea of a Lie bracket approximation for extremum seeking systems and saddle point algorithms, we propose a feedback which steers a single-integrator system to the set of saddle points of the Lagrangian associated to the convex optimization problem.
Hans-Bernd Dürr +2 more
openaire +1 more source
A relaxed splitting preconditioner for saddle point problems
Journal of Numerical Mathematics, 2015AbstractIn this paper, we introduce a relaxed splitting preconditioner for saddle point problems. Spectral properties of the preconditioned matrix are analyzed and compared with the closely related preconditioner in recent paper [New preconditioners for saddle point problems, Appl. Math. Comput. 172 (2006), 762-771] by Pan et al.
Cui-Xia Li, Shi-Liang Wu, Ai-Qun Huang
openaire +1 more source
On Block Preconditioners for Nonsymmetric Saddle Point Problems
SIAM Journal on Scientific Computing, 2001We discuss a class of preconditioning methods for an iterative solution of algebraic nonsymmetric saddle pointproblems arising from a mixed finite element discretization of partial differential equations, in particular the Navier--Stokes equation. We prove that block diagonal and block triangular preconditioners based on symmetric, positive definite ...
openaire +3 more sources
Approximation of Saddle Point Problems
1991This chapter is in a sense the kernel of the book. It sets a general framework in which mixed and hybrid finite element methods can be studied. Even if some applications will require variations of the general results, these could not be understood without the basic notions introduced here. Our first concern will be existence and uniqueness of solutions.
Franco Brezzi, Michel Fortin
openaire +1 more source
CLC in AMG solvers for saddle‐point problems
Numerical Linear Algebra with Applications, 2018SummaryAn algebraic multigrid (AMG) solution method for saddle‐point problems is described. The indefinite nature of the saddle‐point matrix makes it unsuitable for the simple smoothing methods normally used in AMG. Moreover, even if presented in a stabilised form, as is done here, poorly conditioned matrices will be generated when constructing the ...
openaire +2 more sources
Preconditioners for Saddle-Point Problems
2018Preconditioners for saddle-point problems exploit the 2-by-2 block structure of the saddle-point matrix \(\mathbb {A}\). They have been a subject of active research in a whole range of applications. For a current survey, we refer to [67].
openaire +1 more source
Quasi-Newton Methods for Saddle Point Problems
Advances in Neural Information Processing Systems 35, 2022Chengchang Liu, Luo Luo
openaire +2 more sources
Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
SIAM Journal on Numerical Analysis, 1997James H Bramble, Joseph Edward Pasciak
exaly

