Existence of a saddle point in nonconvex constrained optimization.

DOI10.1023/A:1017970111378zbMath1099.90590WikidataQ57445528 ScholiaQ57445528MaRDI QIDQ5959055

No author found.

Publication date: 14 September 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

\(p\)th power formulation; Dual method; Global solution; Nonconvex constrained optimization; Saddle point

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

Related Items

Saddle points of general augmented Lagrangians for constrained nonconvex optimization, Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property, Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming, Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming, Separation approach for augmented lagrangians in Constrained nonconvex optimization, The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization, Saddle point and exact penalty representation for generalized proximal Lagrangians, Existence of local saddle points for a new augmented Lagrangian function, Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization, A reverse augmented constraint preconditioner for Lagrange multiplier methods in contact mechanics, On saddle points in semidefinite optimization via separation scheme, On the existence of saddle points for nonlinear second-order cone programming problems, On convexification for a class of global optimization problems, A note on the existence of saddle points ofp-th power Lagrangian for constrained nonconvex optimization