Skip to main content
Log in

Existence of Augmented Lagrange Multipliers for Semi-infinite Programming Problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Using an augmented Lagrangian approach, we study the existence of augmented Lagrange multipliers of a semi-infinite programming problem and discuss their characterizations in terms of saddle points. In the case of a sharp Lagrangian, we obtain a first-order necessary condition for the existence of an augmented Lagrange multiplier for the semi-infinite programming problem and some first-order sufficient conditions by assuming inf-compactness of the data functions and the extended Mangasarian–Fromovitz constraint qualification. Using a valley at 0 augmenting function and assuming suitable second-order sufficient conditions, we obtain the existence of an augmented Lagrange multiplier for the semi-infinite programming problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Fiacco, A.V., Kortanek, K.O.: Semi-Infinite Programming and Applications, Lecture Notes in Economics and Mathematical Systems, vol. 215. Springer, New York (1983)

    Book  Google Scholar 

  2. Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley, New York (1998)

    MATH  Google Scholar 

  3. Polak, E.: On the mathematical foundations of nondifferentiable optimization in engineering design. SIAM Rev. 29, 21–89 (1987)

    Article  MathSciNet  Google Scholar 

  4. Polak, E., Wuu, T.L.: On the design of stabilizing compensators via semi-infinite optimization. IEEE Trans. Autom. Control 34, 196–200 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Polak, E.: On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems. Math. Program. 62, 385–414 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hettich, R.: An implementation of a discretization method for semi-infinite programming. Math. Program. 34, 354–361 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  7. Still, G.: Discretization in semi-infinite programming: the rate of convergence. Math. Program. 91, 53–69 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods and applications. SIAM Rev. 35, 380–429 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  9. Reemsten, R., Görner, S.: Numerical methods for semi-infinite programming: a survey. In: Reemsten, R., Rückmann, J. (eds.) Semi-Infinite Programming, pp. 195–275. Kluwer Academic Publishers, Boston (1998)

    Google Scholar 

  10. Zhang, L.P., Wu, S.Y., López, M.A.: A new exchange method for convex semi-infinite programming. SIAM J. Optim. 20, 2959–2977 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303–320 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  12. Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283–298. Academic Press, New York (1969)

    Google Scholar 

  13. Buys, J.D.: Dual algorithms for constrained optimization problems. Ph.D. thesis, University of Leiden, Leiden, The Netherlands (1972)

  14. Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control Optim. 12, 268–285 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  15. Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)

    Book  MATH  Google Scholar 

  16. Penot, J.P.: Augmented Lagrangians, duality and growth conditions. J. Nonlinear Convex Anal. 3, 283–302 (2002)

    MathSciNet  MATH  Google Scholar 

  17. Huang, X.X., Yang, X.Q.: A unified augmented Lagrangian approach to duality and exact penalization. Math. Oper. Res. 28, 533–552 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhou, Y.Y., Yang, X.Q.: Some results about duality and exact penalization. J. Glob. Optim. 29, 497–509 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Burachik, R.S., Rubinov, A.: Abstract convexity and augmented Lagrangians. SIAM J. Optim. 18(2), 413–436 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  20. Burachik, R.S.: On primal convergence for augmented Lagrangian duality. Optimization 60(8–9), 979–990 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Burachik, R.S., Iusem, A.N., Melo, J.G.: The exact penalty map for nonsmooth and nonconvex optimization. Optimization 64(4), 717–738 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  22. Shapiro, A., Sun, J.: Some properties of the augmented Lagrangian in cone constrained optimization. Math. Oper. Res. 29, 479–491 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  23. Sun, X.L., Li, D., McKinnon, K.I.M.: On saddle points of augmented Lagrangians for constrained nonconvex optimization. SIAM J. Optim. 15, 1128–1146 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  24. Rückmann, J.J., Shapiro, A.: Augmented Lagrangians in semi-infinite programming. Math. Program. Ser. B 116, 499–512 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  25. Zhou, Y.Y., Zhou, J.C., Yang, X.Q.: Existence of augmented Lagrange multipliers for cone constrained optimization problems. J. Glob. Optim. 58(2), 243–260 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  26. Yang, X.Q.: Second-order global optimality conditions for convex composite optimization. Math. Program. 81, 327–347 (1998)

    MathSciNet  MATH  Google Scholar 

  27. Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley-Interscience, Hoboken, New Jersey (2006)

    Book  MATH  Google Scholar 

  28. Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)

    Book  MATH  Google Scholar 

  29. Clarke, F.H.: Optimization and Nonsmooth Analysis, Classics in Applied Mathematics. SIAM, Philadelphia (1983)

    Google Scholar 

  30. Gauvin, J.: A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math. Program. 12, 136–138 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  31. Burke, J.V.: An exact penalization viewpoint of constrained optimization. SIAM J. Control Optim. 29, 968–998 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  32. Han, S.P., Mangasarian, O.L.: Exact penalty functions in nonlinear programming. Math. Program. 17, 251–269 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  33. Rubinov, A.M., Yang, X.Q.: Lagrange-type Functions in Constrained Non-convex Optimization. Kluwer Academic Publishers, Boston (2003)

    Book  MATH  Google Scholar 

  34. Wang, S., Yang, X.Q., Teo, K.L.: Power penalty method for a linear complementarity problem arising from American option valuation. J. Optim. Theory Appl. 129(2), 227–254 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the referees and the associate Editor for their careful reading and comments which have improved the final presentation of the paper. The work described in this paper was partially supported by Grants from the Research Grants Council of the Hong Kong Special Administrative Region, China (PolyU 5334/08E and PolyU 5292/13E) and by Natural Science Foundation of China (11471235, 11171247 and 11371273).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to X. Q. Yang.

Additional information

Communicated by Marco Antonio López-Cerdá.

This paper is dedicated to the memory of the late Professor Vladimir Demyanov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Burachik, R.S., Yang, X.Q. & Zhou, Y.Y. Existence of Augmented Lagrange Multipliers for Semi-infinite Programming Problems. J Optim Theory Appl 173, 471–503 (2017). https://doi.org/10.1007/s10957-017-1091-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-017-1091-6

Keywords

Mathematics Subject Classification

Navigation