Convexification and existence of a saddle point in a \(p\)th-power reformulation for nonconvex constrained optimization.
From MaRDI portal
Publication:1875620
DOI10.1016/S0362-546X(01)00663-0zbMath1042.90643WikidataQ57445530 ScholiaQ57445530MaRDI QIDQ1875620
Publication date: 26 August 2004
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26)
Related Items (15)
Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ Saddle point and exact penalty representation for generalized proximal Lagrangians ⋮ On convexification for a class of global optimization problems ⋮ Existence of local saddle points for a new augmented Lagrangian function ⋮ Separation approach for augmented lagrangians in Constrained nonconvex optimization ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ 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 ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ Properties of saddle points for generalized augmented Lagrangian ⋮ Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization ⋮ On the existence of saddle points for nonlinear second-order cone programming problems ⋮ A note on the existence of saddle points ofp-th power Lagrangian for constrained nonconvex optimization
This page was built for publication: Convexification and existence of a saddle point in a \(p\)th-power reformulation for nonconvex constrained optimization.
