Skip to main content

First Order Constraint Qualifications

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Optimality Conditions

Duality

Stability

Metric Regularity

Error Bounds

See also

References

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

References

  1. Bank B, Guddat J, Klatte D, Kummer B, Tammer K (1982) Non-linear parametric optimization. Akad. Verlag, Berlin

    Google Scholar 

  2. Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: Theory and algorithms, 2nd edn. Wiley, New York

    MATH  Google Scholar 

  3. Ben-Israel A, Ben-Tal A, Zlobec S (1981) Optimality in nonlinear programming: A feasible direction approach. Wiley, New York

    Google Scholar 

  4. Bonnans JF, Cominetti R (1996) Perturbed optimization in Banach spaces I, II, III. SIAM J Control Optim 34:1151–1171; 1172–1189; 1555–1567

    Article  MathSciNet  MATH  Google Scholar 

  5. Bonnans JF, Shapiro A (2000) Perturbation analysis of optimization problems. Springer, Berlin

    MATH  Google Scholar 

  6. Burke JV, Ferris MC (1993) Weak sharp minima in mathematical programming. SIAM J Control Optim 31:1340–1359

    Article  MathSciNet  MATH  Google Scholar 

  7. Clarke F (1983) Optimization and nonsmooth analysis. Wiley, New York

    MATH  Google Scholar 

  8. Cominetti R (1990) Metric regularity, tangent sets and second-order optimality conditions. Appl Math Optim 21:265–287

    Article  MathSciNet  MATH  Google Scholar 

  9. Dontchev A, Rockafellar RT (1997) Characterizations of Lipschitz stability in nonlinear programming. In: Fiacco AV (ed) Mathematical Programming with Data Perturbations. M. Dekker, New York, pp 65–82

    Google Scholar 

  10. Ekeland I, Temam R (1974) Analyse convexe et problèmes variationnels. Dunod, Paris

    MATH  Google Scholar 

  11. Ferris MC, Mangasarian OL (1992) Minimum principle sufficiency. Math Program 57:1–14

    Article  MathSciNet  MATH  Google Scholar 

  12. Fiacco AV (1983) Introduction to sensitivity and stability analysis. Acad. Press, New York

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Guddat J, Guerra F, Jongen HTh (1990) Parametric optimization: Singularities, pathfollowing and jumps. Wiley, New York

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Hiriart-Urruty J-B, Lemaréchal C (1993) Convex analysis and minimization algorithms I, II. Springer, Berlin

    Google Scholar 

  17. Ioffe AD, Tichomirov VM (1974) Theory of extremal problems. Nauka, Moscow

    Google Scholar 

  18. Jongen HTh, Rückmann Jan-J (1998) On stability and deformation in semi-infinite optimization. In: Reemtsen R, Rückmann J-J (eds) Semi-Infinite Programming. Kluwer, Dordrecht, pp 29–67

    Google Scholar 

  19. Klatte D (1994) On quantitative stability for non-isolated minima. Control and Cybernetics 23:183–200

    MathSciNet  MATH  Google Scholar 

  20. Klatte D, Li W (1999) Asymptotic constraint qualifications and global error bounds for convex inequalities. Math Program 84:137–160

    MathSciNet  MATH  Google Scholar 

  21. Kojima M (1980) Strongly stable stationary solutions on nonlinear programs. In: Robinson SM (ed) Analysis and Computation of Fixed Points. Acad. Press, New York, pp 93–138

    Google Scholar 

  22. Kuhn HW, Tucker AW (1950) Nonlinear programming. In: Neyman J (ed) Proc. Second Berkeley Symp. Math. Stat. Probab. Univ. Calif. Press, Berkeley, CA, pp 481–492

    Google Scholar 

  23. Kummer B (1991) Lipschitzian inverse functions, directional derivatives and application in C1, 1 optimization. J Optim Th Appl 70:559–580

    Article  MathSciNet  Google Scholar 

  24. Kummer B (1997) Lipschitzian and pseudo-Lipschitzian inverse functions and applications to nonlinear programming. In: Fiacco AV (eds) Mathematical Programming with Data Perturbations. M. Dekker, New York, pp 201–222

    Google Scholar 

  25. Kyparisis J (1985) On uniqueness of Kuhn–Tucker multipliers in nonlinear programming. Math Program 32:242–246

    Article  MathSciNet  MATH  Google Scholar 

  26. Li W (1997) Abadie's constraint qualification, metric regularity, and error bounds for differentiable convex inequalities. SIAM J Optim 7:966–978

    Article  MathSciNet  MATH  Google Scholar 

  27. Luo Z-Q, Pang J-S, Ralph D (1996) Mathematical programs with equlibrium constraints. Cambridge Univ. Press, Cambridge

    Google Scholar 

  28. Mangasarian OL, Fromovitz S (1967) The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. J Math Anal Appl 17:37–47

    Article  MathSciNet  MATH  Google Scholar 

  29. Nesterov Y, Nemirovskii A (1994) Interior-point polynomial algorithms in convex programming. SIAM Stud Appl Math. SIAM, Philadelphia

    MATH  Google Scholar 

  30. Pang J-S (1997) Error bounds in mathematical programming. Math Program 79:299–332

    Google Scholar 

  31. Polak E (1997) Optimization: Algorithms and consistent approximations. Springer, Berlin

    MATH  Google Scholar 

  32. Pshenichnyi BN (1969) Necessary conditions for an extremum. Nauka, Moscow

    Google Scholar 

  33. Robinson SM (1976) Regularity and stability for convex multivalued functions. Math Oper Res 1:130–143

    MathSciNet  MATH  Google Scholar 

  34. Robinson SM (1976) Stability theorems for systems of inequalities. Part II: Differentiable nonlinear systems. SIAM J Numer Anal 13:497–513

    Article  MathSciNet  MATH  Google Scholar 

  35. Robinson SM (1980) Strongly regular generalized equations. Math Oper Res 5:43–62

    MathSciNet  MATH  Google Scholar 

  36. Rockafellar RT (1970) Convex analysis. Princeton Univ. Press, Princeton

    MATH  Google Scholar 

  37. Rockafellar RT (1974) Conjugate duality and optimization. Regional Conf Ser Applied Mat. SIAM, Philadelphia

    MATH  Google Scholar 

  38. Rockafellar RT, Wets RJ-B (1997) Variational analysis. Springer, Berlin

    Google Scholar 

  39. Shapiro A (1997) First and second order analysis of nonlinear semidefinite programs. Math Program 77:301–320

    Google Scholar 

  40. Shapiro A (1998) First and second order optimality conditions and perturbation analysis of semi-infinite programming problems. In: Reemtsen R, Rückmann J-J (eds) Semi-Infinite Programming. Kluwer, Dordrecht, pp 103–133

    Google Scholar 

  41. Stoer J, Witzgall C (1970) Convexity and optimization in finite dimensions I. Springer, Berlin

    Google Scholar 

  42. Zowe J, Kurcyusz S (1979) Regularity and stability for the mathematical programming problem in Banach spaces. Appl Math Optim 5:42–62

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Klatte, D. (2008). First Order Constraint Qualifications . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_184

Download citation

Publish with us

Policies and ethics