Skip to main content
SpringerLink
Log in

Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

The paper concerns the study of new classes of parametric optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain, among other constraints, infinitely many inequality constraints. These problems reduce to semi-infinite programs in the case of finite-dimensional spaces of decision variables. We focus on DC infinite programs with objectives given as the difference of convex functions subject to convex inequality constraints. The main results establish efficient upper estimates of certain subdifferentials of (intrinsically nonsmooth) value functions in DC infinite programs based on advanced tools of variational analysis and generalized differentiation. The value/marginal functions and their subdifferential estimates play a crucial role in many aspects of parametric optimization including well-posedness and sensitivity. In this paper we apply the obtained subdifferential estimates to establishing verifiable conditions for the local Lipschitz continuity of the value functions and deriving necessary optimality conditions in parametric DC infinite programs and their remarkable specifications. Finally, we employ the value function approach and the established subdifferential estimates to the study of bilevel finite and infinite programs with convex data on both lower and upper level of hierarchical optimization. The results obtained in the paper are new not only for the classes of infinite programs under consideration but also for their semi-infinite counterparts.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anderson E.J., Nash P.: Linear Programming in Infinite-Dimensional Spaces. Wiley, Chicherster (1987)

    MATH  Google Scholar 

  2. B̦t R.I., Grad S.-M., Wanka G.: On strong and total Lagrange duality for convex optimization problems. J. Math. Anal. Appl. 337, 1315–1325 (2008)

    Article  MathSciNet  Google Scholar 

  3. Burachik R.S., Jeyakumar V.: A dual condition for the convex subdifferential sum formula with applications. J. Convex Anal. 12, 279–290 (2005)

    MATH  MathSciNet  Google Scholar 

  4. Craven B.D.: Mathematical Programming and Control Theory. Chapman and Hall, London (1978)

    MATH  Google Scholar 

  5. Dempe S.: Foundations of Bilevel Programming. Kluwer, Dordrecht (2002)

    MATH  Google Scholar 

  6. Dempe S., Dutta J., Mordukhovich B.S.: New necessary optimality conditions in optimistic bilevel programming. Optimization 56, 577–604 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Demyanov V.F., Rubinov A.M.: Constructive Nonsmooth Analysis. Peter Lang, Frankfurt (1995)

    MATH  Google Scholar 

  8. Dinh N., Goberna M.A., López M.A., Son T.Q.: New Farkas-type results with applications to convex infinite programming. ESAIM: Control Optim. Cal. Var. 13, 580–597 (2007)

    Article  MATH  Google Scholar 

  9. Dinh, N., Goberna, M.A., López, M.A.: On stability of convex infinite programming problems. Preprint (2008)

  10. Dinh, N., Nghia, T.T.A., Vallet, G.: A closedness condition and its applications to DC programs with convex constraints. Optimization, to appear (2008)

  11. Dinh N., Vallet G., Nghia T.T.A.: Farkas-type results and duality for DC programs with convex constraints. J. Convex Anal. 15, 235–262 (2008)

    MATH  MathSciNet  Google Scholar 

  12. Fabian M. et al.: Functional Analysis and Infinite-Dimensional Geometry. Springer, New York (2001)

    MATH  Google Scholar 

  13. Goberna M.A., López M.A.: Linear Semi-Infinite Optimization. Wiley, Chichester (1998)

    MATH  Google Scholar 

  14. Jeyakumar V.: Asymptotic dual conditions characterizing optimality for convex programs. J. Optim. Theory Appl. 93, 153–165 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  15. Jeyakumar, V., Dinh, N., Lee, G.M.: A new closed cone constraint qualification for convex optimization. Applied Mathematics Research Report AMR04/8, School of Mathematics, University of New South Wales, Australia, http://www.maths.unsw.edu.au/applied/reports/amr08.html (2004)

  16. Mordukhovich B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory. Springer, Berlin (2006a)

    Google Scholar 

  17. Mordukhovich B.S.: Variational Analysis and Generalized Differentiation, II: Applications. Springer, Berlin (2006b)

    Google Scholar 

  18. Mordukhovich B.S., Nam N.M.: Variational stability and marginal functions via generalized differentiation. Math. Oper. Res. 30, 800–816 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  19. Mordukhovich B.S., Nam N.M., Yen N.D.: Subgradients of marginal functions in parametric mathematical programming. Math. Prog. 116, 369–396 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  20. Mordukhovich B.S., Shao Y.: Nonsmooth sequential analysis in Asplund spaces. Trans. Am. Math. Soc. 248, 1230–1280 (1996)

    MathSciNet  Google Scholar 

  21. Phelps R.R.: Convex Functions, Monotone Operators and Differentiability, 2nd edn. Springer, Berlin (1993)

    MATH  Google Scholar 

  22. Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  24. Schirotzek W.: Nonsmooth Analysis. Springer, Berlin (2007)

    Book  MATH  Google Scholar 

  25. Ye J.J., Zhu D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  26. Zălinescu C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, International University, Vietnam National University, Ho Chi Minh City, Vietnam

    N. Dinh

  2. Department of Mathematics, Wayne State University, Detroit, MI, 48202, USA

    B. Mordukhovich & T. T. A. Nghia

  3. Department of Mathematics and Computer Science, Ho Chi Minh City University of Pedagogy, Ho Chi Minh City, Vietnam

    T. T. A. Nghia

Authors
  1. N. Dinh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Mordukhovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. T. A. Nghia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. Dinh.

Additional information

Research was partially supported by the USA National Science Foundation under grants DMS-0304989 and DMS-0603846 and by the Australian Research Council under grants DP-0451168. Research of the first author was partly supported by NAFOSTED, Vietnam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dinh, N., Mordukhovich, B. & Nghia, T.T.A. Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs. Math. Program. 123, 101–138 (2010). https://doi.org/10.1007/s10107-009-0323-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-009-0323-4

Keywords

Mathematics Subject Classification (2000)

Search

Navigation