Abstract
In this paper, we introduce a generalized proximal Lagrangian function for the constrained nonlinear programming problem and discuss existence of its saddle points. In particular, the local saddle point is obtained by using the second-order sufficient conditions, and the global saddle point is given without requiring compactness of constraint set and uniqueness of the optimal solution. Finally, we establish equivalent relationship between global saddle points and exact penalty representations.
Similar content being viewed by others
References
Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear Programming: Theory and Algorithms. 2nd edn. Wiley, London (1993)
Bertsekas D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (1982)
Ehrgott M., Wiecek M.M.: Saddle points and pareto points in multiple objective programming. J. Global Optim. 32, 11–33 (2005)
Gasimov R.N.: Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming. J. Global Optim. 24, 187–203 (2002)
Gasimov R.N., Rubinov A.M.: On augmented Lagrangians for optimization problems with a single constraint. J. Global Optim. 28, 153–173 (2004)
Griva I., Polyak R.: Primal-dual nonlinear rescaling method with dynamic scaling parameter update. Math. Progr. 106, 237–259 (2006)
Hestenes M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303–320 (1969)
Huang X.X., Yang X.Q.: A unified augmented Lagrangian approach to duality and exact penalization. Math. Oper. Res. 28, 524–532 (2003)
Huang X.X., Yang X.Q.: Further study on augmented Lagrangian duality theory. J. Global Optim. 31, 193–210 (2005)
Li D.: Zero duality gap for a class of nonconvex optimization problems. J. Optim. Theory Appl. 85, 309–323 (1995)
Li D.: Saddle-point generation in nonlinear nonconvex optimization. Nonlinear Anal. 30, 4339–4344 (1997)
Li D., Sun X.L.: Convexification and existence of saddle point in a pth-power reformulation for nonconvex constrained optimization. Nonlinear Anal. 47, 5611–5622 (2001)
Li D., Sun X.L.: Existence of a saddle point in nonconvex constrained optimization. J. Global Optim. 21, 39–50 (2001)
Luenberger D.G.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley, Reading (1984)
Polyak R.: Modified barrier functions: theory and methods. Math. Progr. 54, 177–222 (1992)
Powell, M.J.D.: A method for nonlinear constraints in minimization problems, In: R. Fletcher (ed.) Optimization, pp. 283–298. New York (1969)
Rockafellar R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control Optim. 12, 268–285 (1974)
Rockafellar R.T.: Lagrangian multipliers and optimality. SIAM Rev. 35, 83–238 (1993)
Rockafellar R.T., Wets J.B.: Variational Analysis. Springer, Berlin (1998)
Rubinov A.M., Huang X.X., Yang X.Q.: The zero duality gap property and lower semicontinuity of the perturbation function. Math. Oper. Res. 27, 775–791 (2002)
Rubinov A.M., Yang X.Q.: Lagrangian-type functions in constrained nonconvex optimization. Kluwer, Massachusetts (2003)
Sun X.L., Li D., Mckinnon K.: On saddle points of augmented Lagrangians for constrained nonconvex optimization. SIAM J.Optim. 15, 1128–1146 (2005)
Tseng P.: On the convergence of the exponential multiplier method for convex programming. Math. Progr. 60, 1–19 (1993)
Wang C.Y., Yang X.Q., Yang X.M.: Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization. J. Global Optim. 27, 473–484 (2003)
Yang X.Q., Huang X.X.: A nonlinear Lagrangian approach to constrained optimization problems. SIAM J.Optim. 11, 1119–1149 (2001)
Zhou Y.Y., Yang X.Q.: Some results about duality and exact penalization. J. Global Optim. 29, 497–509 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, J., Xiu, N. & Wang, C. Saddle point and exact penalty representation for generalized proximal Lagrangians. J Glob Optim 54, 669–687 (2012). https://doi.org/10.1007/s10898-011-9784-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-011-9784-0
Keywords
- Constrained nonlinear programming
- Generalized proximal Lagrangian
- Saddle points
- Exact penalty representations