Skip to main content
SpringerLink
Log in

Optimality Conditions. Preliminary Results

  • Chapter
Constrained Optimization and Image Space Analysis

Part of the book series: Mathematical Concepts and Methods in Science and Engineering ((MCSENG,volume 49))

  • 718 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadie J., “On the Kuhn-Tucker Theorem”. In [I1], pp. 19–36.

    Google Scholar 

  2. Antoni C. and Giannessi F., “On the equivalence, via relaxation-penalization between vector generalized systems” Acta Mathematica Vietnamica, Vol.22, No.2, 1997, pp.567–588.

    MATH  MathSciNet  Google Scholar 

  3. Auslender A., “Optimization. Méthodes numeriques”. Masson, Paris, 1976.

    Google Scholar 

  4. Auslender A., “Noncoercive optimization problems”. Mathem. of Oper.Research, Vol.21, No.4, 1966, pp.769–782.

    MathSciNet  Google Scholar 

  5. Balas E., “Nonconvex quadratic programming via generalized polars”. SIAM Jou. on Appl.Mathem., Vol.28, No.2, 1975, pp.335–349.

    Article  MATH  MathSciNet  Google Scholar 

  6. Bank B., Guddat J., Klatte D., Kummer B. and Tammer K., “Non-linear Parametric Optimization”. Akademie-Verlag, Berlin, 1982.

    MATH  Google Scholar 

  7. Ben-Tal A. and Zowe J., “Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems”. Mathematical Programming, Vol.24, 1982, pp.70–91.

    Article  MATH  MathSciNet  Google Scholar 

  8. Bigi G. and Pappalardo M., “Regularity conditions for the linear separation of sets”. Jou.Optimiz. Th.Appls., Vol.99, No.2, 1998, pp.533–540.

    Article  MATH  MathSciNet  Google Scholar 

  9. Bigi G. and Pappalardo M., “Generalized Lagrange multipliers: regularity and boundedness”. In [I19], pp. 1–14.

    Google Scholar 

  10. Bonnesen T., “Les problémes des isopérimétres et des isépiphanes”. Gauthier-Villars, Paris, 1929, pp. 11–13.

    MATH  Google Scholar 

  11. Borwein J., “Multivalued convexity and Optimization: a unified approach to inequality and equality constraints”. Mathematical Programming, Vol.13, 1977, pp.183–199.

    Article  MATH  MathSciNet  Google Scholar 

  12. Bussotti P., “On the Genesis of the Lagrange Multipliers”. Jou. of Optimiz. Theory and Appls., Vol.117, No.3, 2003, pp.453–459.

    Article  MATH  MathSciNet  Google Scholar 

  13. Castellani M., Mastroeni G. and Pappalardo M., “On regularity for generalized systems and applications”. In [I18], pp. 13–26.

    Google Scholar 

  14. Castellani M., Mastroeni G. and Pappalardo M., “Separation of Sets, Lagrange Multipliers and Totally Regular Extremum Problems”. Jou.Optiz.Th.Appls., Vol.92, No.2, pp.249–261.

    Google Scholar 

  15. Castellani M. and Pappalardo M., “First order cone approximations and necessary optimality conditions”. Optimization, Vol.35, 1995, pp.113–126.

    MATH  MathSciNet  Google Scholar 

  16. Castellani M. and Pappalardo M., “Local second-order approximations and applications in optimization”. Optimization, Vol.37, 1996, pp.305–321.

    MATH  MathSciNet  Google Scholar 

  17. Cesari L., “Optimization Theory and Applications”. Springer-Verlag, New York, 1983.

    MATH  Google Scholar 

  18. Castellani M. and Pappalardo M., “Unifying approach for higher-order necessary optimality conditions”. Communications Appl.Analysis, Vol.3, No.1, 1999, pp.15–28.

    MATH  MathSciNet  Google Scholar 

  19. Chaney R.W., “On sufficient conditions in nonsmooth optimization”. Mathem.of Oper.Research, Vol.7, pp.463–475.

    Google Scholar 

  20. Clarke F.H., “A new approach to Lagrange multipliers”. Mathem.of Oper.Research, Vol.1, 1979, pp.165–174.

    Google Scholar 

  21. Cohen G., “Auxiliary Problem Principle and Decomposition of Optimization Problems”. Jou.Optimiz.Th.Appls., Vol.32, No.3, 1980, pp.277–305.

    Article  MATH  Google Scholar 

  22. Cottle R.W., “Theorem of Fritz John in mathematical Programming”. Report RM-3858-PR of The Rand Corporation (Santa Monica, California), 1963, pp. I–V+l–10.

    Google Scholar 

  23. Craven B.D., “Avoiding a constraint qualification”. Optimization, Vol.41, 1997, pp.291–302.

    MATH  MathSciNet  Google Scholar 

  24. Dem’yanov V.F. and Vasiliev L.V., “Nondifferentiable Optimization”. Nauka, Moscow, 1981.

    MATH  Google Scholar 

  25. Ekeland I., “On the Variational Principle”. Jou. of Mathem. Analysis and Appls., Vol.47, 1974, pp.324–353.

    Article  MATH  MathSciNet  Google Scholar 

  26. Elster K.H. and Sutti C. (Eds.), “Mathematical Optimization. Theory Methods and Applications”. Proc. Workshop Days (Verona, Dec. 9, 1992), Published by Univ.of Verona, Via dell’Artigliere, 19-Verona, Italy, 1993.

    Google Scholar 

  27. Elster K.H. and Thierfelder J., “Abstrac cone approximations and generalized directional derivatives”. Optimization, Vol.19, 1998, pp.315–341.

    MathSciNet  Google Scholar 

  28. Everett H., “Generalized Lagrange multiplier method for solving problems of optimum allocation of resources”. Operations Research, Vol.11, 1963, pp.399–417.

    Article  MATH  MathSciNet  Google Scholar 

  29. Evtushenko Yu.G., Rubinov A.M. and Zhadan V.G., “General Lagrange-type functions in constrained global optimization. Part I: auxiliary functions and optimality conditions”. Optimization Methods ad Software, Vol.16, 2001, pp.193–230.

    MATH  MathSciNet  Google Scholar 

  30. Evtushenko Yu.G., Rubinov A.M. and Zadhan V.G., “General Lagrange-type functions in constrained global optimization. Part. II: exact auxiliary functions”. OP-timization Methods and Software, Vol.16, pp.231–256.

    Google Scholar 

  31. Ferrero O., “On nonlinear Programming in Complex Spaces”. Jou. Mathem. Analysis Appls., Vol.164, No.2, pp.399–416.

    Google Scholar 

  32. Foudas C.A. and Pardalos P.M. (Eds.), “Encyclopedia of Optimization”. Kluver Academie Publishers, Dordrecht, 2001, Vols.I–V.

    Google Scholar 

  33. Gao Y., “Dem’yanov Difference of Two Sets and Optimality Conditions of Lagrange Multiplier Type for Constrained Quasidifferentiable Optimization”. Jou.Optimiz.Th. Appls., Vol.104, No.2, 2000, pp.337–394.

    Google Scholar 

  34. Giannessi F. “Sulla legge di reciprocità nei problemi di massimo e minimo condizionati” (“On the reciprocity principle for maximum and minimum constrained problems”; in Italian). Proceedings of the Institute of Mathematics of Univ.of Venice, 1970, published by CEDAM, Padova, Italy, pp.71–95.

    Google Scholar 

  35. Giannessi F., “Functional aspects od Dynamic Programming”. Control and Cybernetics, Vol.2, No.3/4, 1977, pp.31–42.

    MathSciNet  Google Scholar 

  36. Giannessi F., “On Lagrangian Non-Linear Multipliers Theory for Constrained Optimization and related topics”, Tech. Report No.123, Dept. of Mathem., Univ.of Pisa, Sect. of Optimization, 1984, pp.1–79. Published as “General Optimality Conditions via a Separation Scheme”. In “Algorithms for Continuous Optimization”, E. Spedicato (Ed.), Kluver Acad.Publishers, Dordrecht, Boston, 1994, pp.1–23.

    Google Scholar 

  37. Giannessi F., “A common understanding or a common misunderstanding?”. Numer.Funct.Analysis and Optimiz., Vol.16, No.9–10, 1995, pp.1359–1363.

    MATH  MathSciNet  Google Scholar 

  38. Giannessi F., “Some Remarks on Minimum Priciples”. In Pardalos P.M. (Eds.), “Advances in Convex Analysis and Global Optimization”. Series Nonconvex Optimiz. and its Appls., Vol.54, Kluver, Dordrecht, 2001 [47], pp.75–103.

    Google Scholar 

  39. Giannessi F., “On the existence of Lagrange multipliers”. Proceedings of “Seminario Matematico” of Univ.of Messina, Series II, No.7, pp. 1–20.

    Google Scholar 

  40. Giannessi F., Mastroeni G. and Uderzo A., “A multifunction approach to extremum problems having infinite dimensional image. Necessary coonditions for unilateral constraints”. Kibernetika (National Academy of Sciences of Ucraina), Vol.3, May 2002, pp.39–51.

    MATH  MathSciNet  Google Scholar 

  41. Giannessi F. and Niccolucci F., “Connections between nonlinear and integer programming problems”. In “Symposia Mathematica”, Vol.XIX, Academic Press, London, 1976, pp. 161–176.

    Google Scholar 

  42. Giannessi F., Pappalardo M. and Pellegrini L., “Necessary Optimality Conditions via Image Problem”. In [I9], pp.185–217.

    Google Scholar 

  43. Giannessi F. and Tardella F., “Connections between Nonlinear Programming and Discrete Optimization”. In “Handbook of Combinatorial Optimization” edited by Du D.-Z. and Pardalos P., Vol.1, Kluver Acad.Publ., 1998, pp.149–188.

    Google Scholar 

  44. Giannessi F. and Tomasin E., “Nonconvex quadratic programs, linear complementarity problems, and integer linear programs”. In “Mathematical Programming in Theory and Practice”, P.L. Hammer and G. Zoutendijk Eds., North-Holland, 1974, pp.161–199.

    Google Scholar 

  45. Giorgi G., “On Sufficient Optimality Conditions for a Quasiconvex Programming Problem”. Jou.Optimiz.Th.Appls., Vol.81, No.2, 1994, pp.401–405.

    Article  MATH  MathSciNet  Google Scholar 

  46. Goh C.J. and Yang X.Q., “Nonlinear Lagrangian Theory for Nonconvex Optimization”. Jou.Optimiz.Th.Appls., Vol.109, No.1, 2001, pp.99–121.

    Article  MATH  MathSciNet  Google Scholar 

  47. Hadijsavvas and Pardalos P.M. (Eds.), “Advances in Convex Analysis and Global Optimization”. Series Nonconvex Optimiz. and its Appls., Vol.54, Kluver, Dordrecht, 2001.

    Google Scholar 

  48. Hanson M.A., “On sufficiency of the Kuhn-Tucker conditions”. Jou.Mathem. Analysis Appls., Vol.80, 1981, pp.545–550.

    Article  MATH  MathSciNet  Google Scholar 

  49. Hanson M.A., “A generalization of the Kuhn-Tucker sufficiency conditions”. Jou. Mathem.Analysis Appls., Vol.184, 1994, pp.146–155.

    Article  MATH  MathSciNet  Google Scholar 

  50. Hanson M.A. and Mond B., “Necessary and sufficient conditions in constrained optimization”. Mathematical Programming, Vol.37, 1987, pp.51–58.

    MATH  MathSciNet  Google Scholar 

  51. Hestenes M.R., “Multiplier and gradient methods”. Jou. of Optimiz. Theory and Appls., Vol.4, No.5, 1969, pp.303–320.

    Article  MATH  MathSciNet  Google Scholar 

  52. Hiriart-Urruty J.-B., “On optimality conditions in nondifferentiable programming”. Mathematical Programming, Vol.14, 1978, pp.73–86.

    Article  MATH  MathSciNet  Google Scholar 

  53. Hiriart-Urruty J.-B., “From convex optimization to nonconvex optimization. Necessary and sufficient conditions for global optimality”. In [I9], pp.219–239.

    Google Scholar 

  54. Hiriart-Urruty J.-B., “Testing necessary and sufficient conditions for global optimality in the problem of maximizing a convex quadratic function over a convex polyhedron”. Report of Univ.Paul Sabatier, Seminar of Numerical Analysis, 1990, pp. 1–34.

    Google Scholar 

  55. Hiriart-Urruty J.-B., “Boris Nicolaevich Pshenichnyi: two examples of his scientific works”. Cybernetics and Systems Analysis, No.3, 2002, pp.68–73.

    MATH  MathSciNet  Google Scholar 

  56. Horst R. and Tuy H., “Global Optimization”. Springer-Verlag, Berlin, 1990.

    MATH  Google Scholar 

  57. Joffe A.D., “Necessary conditions in nonsmooth optimization”. Mathem.of Oper. Research, Vol.9, No.2, 1984, pp.159–189.

    Google Scholar 

  58. Joffe A.D., “Nonconvex subdifferentials”. In [I9], pp.241–253.

    Google Scholar 

  59. Jeyakumar V., “On optimality conditions in nonsmooth inequality constrained minimization”. Numer.Punct.Analysis and Optimiz., Vol.9, 1987, pp.535–546.

    MATH  MathSciNet  Google Scholar 

  60. Komlósi S. and Pappalardo M., “A general scheme for first order approximations in optimization”. Optimiz.Meth. and Soft., Vol.3, 1994 pp.143–152.

    Google Scholar 

  61. Leitmann G., “The Calculus of Variations and Optimal Control”. Plenum Publ. Co., New York, 1981.

    MATH  Google Scholar 

  62. Mangasarian O.L. and Fromovitz S., “A Maximum Principle in Mathematical Programming”. In “Mathematical Theory of Control”, A.V. Balakrishnan and L.W. Neustadt Eds., Academic Press, 1967, pp85–95.

    Google Scholar 

  63. Martein L., “Regularity Conditions for Constrained Extremum Problems”. Jou. Optimiz.Th.Appls., Vol.47, 1985, pp.217–233.

    Article  MATH  MathSciNet  Google Scholar 

  64. Maugeri A., “Convex programming, variational inequalities and applications to traffic equilibrium problems”. Appl.Mathem.Optimiz., Vol.16, 1987, pp.169–185.

    Article  MATH  MathSciNet  Google Scholar 

  65. Maugeri A., “Optimization problems with side constraints and generalized equilibrium principles”. Le Matematiche, Vol.XLIX, Fasc.II, published by Dept.of Mathematics, Univ.of Catania, Italy, 1994, pp.305–312.

    Google Scholar 

  66. Miele A., “Theory of Optimum Aerodynamic Shapes”. Academic Press, New York, 1965.

    MATH  Google Scholar 

  67. Mordukhovich B.S. and Outrata J., “On second-order subdifferentials and their applications”. SIAM Jou. on Optimiz., Vol.12, No.1, 2001, pp.139–169.

    Article  MATH  MathSciNet  Google Scholar 

  68. Ngai H.V. and Théra M., “On Necessary Conditions for NonLipschitz Optimization Problems”. SIAM Jou.on Optimization, Vol.12, No.3, 2002, pp.565–668.

    Google Scholar 

  69. Pappalardo M., “A necessary optimality condition for nondifferentiable constrained extremum problems”. Optimization, Vol.22, No.6, 1991, pp.869–883.

    MATH  MathSciNet  Google Scholar 

  70. Pappalardo M., “Stability sudies in parametric optimization via the image space approach”. In “Mathematical Research, Parametric Optimization and Related Topics. II”, J. Guddat, H.Th. Jongen, B. Kummer and F. Nožička Eds., Vol.62, Akademie Verlag, 1991, pp.137–145.

    Google Scholar 

  71. Pappalardo M., “Error bounds for generalized Lagrange multipliers in locally Lipschitz programming”. Jou.Optimiz.Th.Appls., Vol.73, 1992, pp.205–210.

    Article  MATH  MathSciNet  Google Scholar 

  72. Pappalardo M., “Sufficient optimality conditions in nondifferentiable otimization”. Optimization, Vol.50, 2001, pp.413–426.

    MATH  MathSciNet  Google Scholar 

  73. Pardalos P.M., “Continuous approaches to discrete optimization problems”. In. [I18], pp.313–328.

    Google Scholar 

  74. Pellegrini L., “A sufficient condition for semistationarity in constrained optimization”. In [I26], pp.

    Google Scholar 

  75. Penot J.-P., “Optimality conditions for midly nonsmooth constrained optimization”. Optimization, Vol.43, 1998, pp.323–337.

    MATH  MathSciNet  Google Scholar 

  76. Penot J.-P., “Characterization of Solution Set of Quasiconvex Program”. Jou. Optimiz.Th.Appls., Vol.117, No.3, 2003, pp.627–636.

    Article  MATH  MathSciNet  Google Scholar 

  77. Penot J.-P., “Lagrangian Approach to Quasiconvex Programming”. Jou.Optimiz. Th.Appls., Vol.117, No.3, 2003, pp.637–647.

    Article  MATH  MathSciNet  Google Scholar 

  78. Pesch H.J. and Bulirsch R., “The Maximum Principle, Bellman’s Equation, and Carathéodory’s Work”. Jou.Optimiz.Th.Appls., Vol.80, No.2, 1994, pp.199–225.

    Article  MATH  MathSciNet  Google Scholar 

  79. Poljack B.T., “A general method for solving extremum problems”. Dokl.Akad.Nauk SSSR, Tom. 174, No.1, 1967, pp.593–597.

    Google Scholar 

  80. Pourciau B.H., “Multipliers rules”. Amer.Mathem.Monthly, Vol.87, 1980, pp.443–452.

    MathSciNet  Google Scholar 

  81. Pourciau B.H., “Multipliers rules and separation of convex sets”. Jou.Optimiz.Th. Appls., Vol.40, 1983, pp.321–331.

    Article  MATH  MathSciNet  Google Scholar 

  82. Qi L.Q., “On an Extended Lagrange Claim”. Jou.Optimiz.Th.Appls., Vol.108, No.3, 2001, pp.685–688.

    Article  MATH  Google Scholar 

  83. Quang P.H., “Lagrangian multiplier rules via image space analysis”. In [I 25], pp.354–378.

    Google Scholar 

  84. Rademacher H., “Uber partielle und totale Differenzierbarkeit”. Mathematische Annalen, Vol.79, No.1, 1919, pp.340–359.

    Article  MathSciNet  Google Scholar 

  85. Rapcsák T., “Geodesic convexity in nonlinear optimization”. Jou.Optimiz.Th.Appls., Vol.69, 1991, pp.169–183.

    Article  MATH  Google Scholar 

  86. Rapcsák T., “On nonlinear coordinate representation of nonsmooth optimization problems”. Jou.Optimiz.Th.Appls., Vol.86, No2, 1995, pp.459–489.

    Article  MATH  Google Scholar 

  87. Rapcsák T., “Global Lagrange multiplier rule and nonsmooth exact penalty functions for equally constraints”. In [I 19], pp.351–358.

    Google Scholar 

  88. Rapcsák T. and Thang T.T., “Nonlinear Coordinate Representations of Smooth Optimization Problems”. Jou.Optimiz.Th.Appls., Vol.86, No2, 1995, pp.459–489.

    Article  MATH  Google Scholar 

  89. Robinson S.M., “First order conditions for general nonlinear optimization”. SIAM Jou.Appl.Math., Vol.30, No4, 1976, pp.597–607.

    Article  MATH  Google Scholar 

  90. Robinson S.M., “Local structure of feasible sets in nonlinear programming, Part II: stability and sensitivity”. Mathematical Programming Study, No.30, North-Holland, 1987, pp.45–66.

    MATH  Google Scholar 

  91. Rockafellar R.T., “The Theory of Subgradients and its Applications to Problems of Optimixation”. Convex and Nonconvex Functions. Heldermann Verlag, Berlin, 1981.

    Google Scholar 

  92. Rockafellar R.T., “Perturbation of generalized Kuhn-Tucker points in finite-dimensional optimization”. In [I19], pp.393–402.

    Google Scholar 

  93. Rockafellar R.T., “Extended nonlinear programming”. In [I19], pp.381–399.

    Google Scholar 

  94. Rockafellar R.T., “First and second order epi-differentiability in nonlinear programming”. Trans.Amer.Mathem.Soc, Vol.325, 1991, pp.39–72.

    Article  MATH  MathSciNet  Google Scholar 

  95. Rubinov A.M., “Differences of convex compact sets and their applications in non-smooth analysis”. In [I25], pp.336–378.

    Google Scholar 

  96. Rubinov A.M. and Uderzo A., “On Global Optimality Conditions via Separation Functions”. Jou.Optimiz.Th.Appls., Vol.109, No.2, 2001, pp.345–370.

    Article  MATH  MathSciNet  Google Scholar 

  97. Rubinov. A.M. and Yang X.Q., “Lagrange-type Functions in Constrained Non-convex Optimization”. Kluver, Dordrecht, to appear.

    Google Scholar 

  98. Scorza Dragoni G., “Sui minimi e massimi parziali per le funzioni di più variabili.”. Rendiconti Accademia Naz.Lincei, Roma, Vol.VI, serie 12, 1927, pp.579–583.

    Google Scholar 

  99. Scorza Dragoni G., “Un problema sui minimi e massimi parziali di una funzione”. Rendiconti Accademia Naz.Lincei, Roma, Vol.XI, serie 6, 1930, pp.865–872.

    Google Scholar 

  100. Smith R.H. and Vandenlinde V.D., “A saddle-point optimality criterion for non-convex programming in normed spaces”. SIAM Jou. on Appl.Mathem., Vol.23, no.2, 1972, pp.203–213.

    Article  MATH  Google Scholar 

  101. Sutti C, “On a monotone generalized derivative”. In [I26], pp.

    Google Scholar 

  102. Tuy H., “Concave programming under linear constraints”. Soviet Mathematics, Vol.5, 1964, pp. 1437–1440.

    Google Scholar 

  103. Tuy H. and Oettli W., “On necessary and sufficient conditions for global optimality”. Revista de Matemáticas Aplicadas, Vol.15, Universidad de Chile, 1994, pp.39–41.

    MATH  MathSciNet  Google Scholar 

  104. Uderzo A., “Quasi-multiplier rules for quasidifferentiable extremum problems”. Optimization, Vol.51, No.6, 2002, pp.761–795.

    Article  MATH  MathSciNet  Google Scholar 

  105. Warga J., “Controllability and Necessary Conditions in Unilateral Problems without differentiabilty assumptions”. SIAM Jou. on Control and Optimiz., Vol.14, 1976, pp.546–573.

    Article  MATH  MathSciNet  Google Scholar 

  106. Yang X.Q. and Huang X.X., “A nonlinear Lagrangian approach to constrained optimization problems”. SIAM Jou. on Optimiz., Vol.11, No.4, 2001, pp.1119–1144.

    Article  MATH  MathSciNet  Google Scholar 

  107. Yang X.M., Yang X.Q. and Teo K.L., “Characterizations and Applications of Prequasi-Invex Functions”. Jou.Optimiz.Th.Appls., Vol.110, No.3, 2001, pp.645–668.

    Article  MATH  MathSciNet  Google Scholar 

  108. ZĂlinescu C, “Stability for a class of nonlinear optimization problems”. In [I9], pp.437–458.

    Google Scholar 

  109. ZĂlinescu C., “On a new stability condition in mathematical programming”. In [I25], pp.429–438.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

(2005). Optimality Conditions. Preliminary Results. In: Constrained Optimization and Image Space Analysis. Mathematical Concepts and Methods in Science and Engineering, vol 49. Springer, Boston, MA . https://doi.org/10.1007/0-387-28020-0_5

Download citation

Publish with us

Policies and ethics

Search

Navigation