Existence of a Saddle Point in Nonconvex Constrained Optimization

Journal of Global Optimization

Volumn 21, Issue 1, 2001, Pages 39-50

  Li, D ^a   Sun, X L ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

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

Indexed keywords

EID: 0035446193     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017970111378     Document Type: Article

References (6)

1. Karlin, S. (1959), Mathematical Methods and Theory in Games, Programming and Economics, Vol. 1, Addison-Wesley, Reading, Massachusetts.
2. Minoux, M. (1986), Mathematical Programming: Theory and Algorithm, John Wiley and Sons, New York.
3. Li, D. (1995), Zero duality gap for a class of nonconvex optimization problems, Journal of Optimization Theory and Applications 85: 309-324.
4. Li, D. (1997), Saddle-point generation in nonlinear nonconvex optimization, Nonlinear Analysis 30: 4339-4344.
5. Luenberger, D.G. (1984), Linear and Nonlinear Programming, Second Edition, Addison-Wesley, Reading, Massachusetts.
6. Xu, Z.K. (1997), Local saddle points and convexification for nonconvex optimization problems, Journal of Optimization Theory and Applications 94: 739-746.