Convexification and existence of a saddle point in a pth-power reformulation for nonconvex constrained optimization

Nonlinear Analysis, Theory, Methods and Applications

Volumn 47, Issue 8, 2001, Pages 5611-5622

  Li, D ^a,b   Sun, X L ^a,b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b NONE

Author keywords

Lagrangian duality; Nonconvex constrained optimization; P th power reformulation; Saddle point

Indexed keywords

CONSTRAINT THEORY; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PERTURBATION TECHNIQUES;

NONCONVEX CONSTRAINED OPTIMIZATION; SADDLE POINT;

LAGRANGE MULTIPLIERS;

EID: 0035423108     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0362-546X(01)00663-0     Document Type: Article

References (11)

1. On the convergence rate of a penalty function method of exponential type
2. Mathematical methods and theory in games
3. Zero duality gap for a class of nonconvex optimization problems
4. Local convexification of the Lagrangian functions in nonconvex optimization
5. New applications of duality in convex programming
6. On the convergence of the exponential multiplier method for convex programming
7. Local saddle points and convexification for nonconvex optimization problems