Skip to main content
Log in

Necessary Optimality Conditions in Terms of Convexificators in Lipschitz Optimization

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

Abstract

This study is devoted to constraint qualifications and Kuhn-Tucker type necessary optimality conditions for nonsmooth optimization problems involving locally Lipschitz functions. The main tool of the study is the concept of convexificators. First, the case of a minimization problem in the presence of an arbitrary set constraint is considered by using the contingent cone and the adjacent cone to the constraint set. Then, in the case of a minimization problem with inequality constraints, Abadie type constraint qualifications and several other qualifications are proposed; Kuhn-Tucker type necessary optimality conditions are derived under the qualifications.

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. Demyanov, V. F., Convexification and Concavification of Positively Homogeneous Functions by the Same Family of Linear Functions, Technical Report, University of Pisa, pp. 1–11, 1994.

  2. Demyanov, V. F., and Rubinov, A. M., Constructive Nonsmooth Analysis, Verlag Peter Lang, Frankfurt am Main, Germany, 1995.

    MATH  Google Scholar 

  3. Demyanov, V. F., and Jeyakumar, V., Hunting for a Smaller Convex Subdifferential, Journal of Global Optimization, Vol. 10, pp. 305–326, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  4. Jeyakumar, V., Simple Characterizations of Superlinear Convergence for Semismooth Equations via Approximate Jacobians, Report AMR98/28, University of New South Wales, Sydney, Australia, 1998.

    Google Scholar 

  5. Jeyakumar, V., Luc, D. T., and Schaible, S., Characterizations of Generalized Monotone Nonsmooth Continuous Maps Using Approximate Jacobians, Journal of Convex Analysis, Vol. 5, pp. 119–132, 1998.

    MathSciNet  MATH  Google Scholar 

  6. Jeyakumar, V., and Luc, D. T., Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization, SIAM Journal on Control and Optimization, Vol. 36, pp. 1815–1832, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  7. Jeyakumar, V., and Luc, D. T., Nonsmooth Calculus, Minimality, and Monotonicity of Convexificators, Journal of Optimization Theory and Applications, Vol. 101, pp. 599–621, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  8. Jeyakumar, V., and Wang, W., Approximate Hessian Matrices and Second-Order Optimality Conditions for Nonlinear Programming Problem with C1-Data, Journal of the Australian Mathematical Society, Vol. 40B, pp. 403–420, 1999.

    MathSciNet  Google Scholar 

  9. Jeyakumar, V., and Yang, X. Q., Approximate Generalized Hessians and Taylor's Expansions for Continuously Gateaux Differentiable Functions, Nonlinear Analysis: Theory, Methods, and Applications, Vol. 36, pp. 353–368, 1999.

    Article  MathSciNet  Google Scholar 

  10. Uderzo, A., Convex Approximators, Convexificators, and Exhausters: Application to Constrained Extremum Problem, Quasidifferentiability and Related Topics, Nonconvex Optimization and Applications, Kluwer Academic Publishers, Dordrecht, Holland, Vol. 43, pp. 297–327, 2000.

    Google Scholar 

  11. Wang, X., and Jeyakumar, V., A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints, SIAM Journal on Optimization, Vol. 10, pp. 1136–1148, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  12. Dutta, J., and Chandra, S., Convexificators, Generalized Convexity, and Optimality Conditions, Journal of Optimization Theory and Applications, Vol. 113, pp. 41–64, 2002.

    Article  MathSciNet  MATH  Google Scholar 

  13. Luc, D. T., A Multiplier Rule for Multiobjective Programming Problems with Continuous Data, SIAM Journal on Optimization, Vol. 13, pp. 168–178, 2002.

    Article  MathSciNet  MATH  Google Scholar 

  14. Clarke, F. H., Optimization and Nonsmooth Analysis, Wiley, New York, NY, 1983.

    MATH  Google Scholar 

  15. Michel, P., and Penot, J. P., A Generalized Derivative for Calm and Stable Functions, Differential and Integral Equations, Vol. 5, pp. 433–454, 1992.

    MathSciNet  MATH  Google Scholar 

  16. Ioffe, A. D., Approximate Subdifferentials and Applications, II, Mathematika, Vol. 33, pp. 111–128, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  17. Mordukhovich, B. S., and SHAO, Y., On Nonconvex Subdifferential Calculus in Banach Space, Journal of Convex Analysis, Vol. 2, pp. 211–228, 1995.

    MathSciNet  MATH  Google Scholar 

  18. Treiman, J. S., The Linear Nonconvex Generalized Gradient and Lagrange Multipliers, SIAM Journal on Optimization, Vol. 5, pp. 670–680, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  19. Pang, J. S., and Qi, L., Nonsmooth Equations, SIAM Journal on Optimization, Vol. 3, pp. 443–465, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  20. Hiriart-Urruty, J. B., On Optimality Conditions in Nondifferentiable Programming, Mathematical Programming, Vol. 14, pp. 73–86, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  21. Nguyen, V. H., Strodiot, J. J., and Mifflin, R., On Conditions to Have Bounded Multipliers in Locally Lipschitz Programming, Mathematical Programming, Vol. 18, pp. 100–106, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  22. Pappalardo, M., Error Bounds for Generalized Lagrange Multipliers in Locally Lipschitz Programming, Journal of Optimization Theory and Applications, Vol. 73, pp. 205–210, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  23. Jourani, A., Constraint Qualifications and Lagrange Multipliers in Nondifferentiable Programming Problems, Journal of Optimization Theory and Applications, Vol. 81, pp. 533–548, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  24. Li, X. F., Constraint Qualifications in Nonsmooth Multiobjective Optimization, Journal of Optimization Theory and Applications, Vol. 106, pp. 373–398, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  25. Jeyakumar, V., On Optimality Conditions in Nonsmooth Inequality Constrained Minimization, Numerical Functional Analysis and Optimization, Vol. 9, pp. 535–546, 1987.

    MathSciNet  MATH  Google Scholar 

  26. Merkovsky, R. R., and Ward, D. E., General Constraint Qualifications in Nondifferentiable Programming, Mathematical Programming, Vol. 47, pp. 389–405, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  27. Ben-Isreal, A., Linear Equations and Inequalities on Finite-Dimensional, Real or Complex, Vector Spaces: A Unified Theory, Journal of Mathematical Analysis and Applications, Vol. 27, pp. 367–389, 1969.

    Article  MathSciNet  Google Scholar 

  28. Rockafellar, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    MATH  Google Scholar 

  29. Yu, P. L., Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Journal of Optimization Theory and Applications, Vol. 14, pp. 319–348, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  30. Sterna-Karwat, A., Remarks on Convex Cones, Journal of Optimization Theory and Applications, Vol. 59, pp. 335–340, 1988.

    MathSciNet  MATH  Google Scholar 

  31. Bazaraa, M. S., Goode, J. J., and Shetly, C. M., Constraint Qualifications Revised, Management Science, Vol. 18, pp. 567–573, 1972.

    MathSciNet  MATH  Google Scholar 

  32. Martin, D. H., and Watkins, G. G., Cores of Tangent Cones and Clarke's Tangent Cone, Mathematics of Operations Research, Vol. 10, pp. 565–575, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  33. Ward, D. E., Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization, Translations of the American Mathematical Society, Vol. 302, pp. 661–682, 1987.

    Article  MATH  Google Scholar 

  34. Dancs, S., Generalized Tangent Cone and an Optimization Problem in a Normed Space, Journal of Optimization Theory and Applications, Vol. 67, pp. 43–55, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  35. Ward, D. E., and Lee, G. M., Generalized Properly Efficient Solutions of Vector Optimization Problems, Mathematical Methods of Operations Research, Vol. 53, pp. 215–232, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  36. Abadie, J., On the Kuhn-Tucker Theorem, Nonlinear Programming, Edited by J. Abadie, John Wiley, New York, NY, pp. 21–36, 1967.

    Google Scholar 

  37. Mangasarian, O. L., and Fromovtiz, S., The Fritz-John Necessary Optimality Condition in the Presence of Equality and Inequality Constraints, Journal of Mathematical Analysis and Applications, Vol. 17, pp. 37–47, 1967.

    Article  MathSciNet  MATH  Google Scholar 

  38. Gould, F. J., and Tolle, J. W., A Necessary and Sufficient Qualification for Constrained Optimization, SIAM Journal on Applied Mathematics, Vol. 20, pp. 164–172, 197.

  39. Gauvin, J., A Necessary and Sufficient Regularity Condition to Have Bounded Multipliers in Nonconvex Programming, Mathematical Programming, Vol. 12, pp. 136–138, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  40. Maeda, T., Constraint Qualifications in Multiobjective Optimization Problems: Differentiable Case, Journal of Optimization Theory and Applications, Vol. 80, pp. 483–500, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  41. Preda, V., and Chitescu, I., On Constraint Qualification in Multiobjective Optimization Problem: Semidifferentiable Case, Journal of Optimization Theory and Applications, Vol. 100, pp. 417–433, 1999.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by S. Schaible

The authors thank the referees for bringing to their attention some papers closely related to this study and for helpful comments and constructive suggestions that have greatly improved the original version of the paper. Further, they are indebted to Professors H. W. Sun and F. Y. Lu, who suggested an example for this paper. The first author thanks S. Schaible for encouragement during this research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, X.F., Zhang, J.Z. Necessary Optimality Conditions in Terms of Convexificators in Lipschitz Optimization. J Optim Theory Appl 131, 429–452 (2006). https://doi.org/10.1007/s10957-006-9155-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-006-9155-z

Keywords

Navigation