Journal of Optimization Theory and Applications

, Volume 127, Issue 2, pp 367–388 | Cite as

Stronger Kuhn-Tucker Type Conditions in Nonsmooth Multiobjective Optimization: Locally Lipschitz Case

  • X. F. Li
  • J. Z. Zhang
Article

Abstract

For an inequality constrained nonsmooth multiobjective optimization problem, where the objective and constraint functions are locally Lipschitz, a nonsmooth analogue of the Maeda-type Guignard constraint qualification is given; stronger Kuhn-Tucker type necessary optimality conditions are derived that are expressed in terms of upper convexificators. Moreover, other constraint qualifications sufficient for the nonsmooth analogue are introduced and their relationships are presented.

Keywords

Nonsmooth multiobjective optimization constraint qualifications stronger Kuhn-Tucker conditions locally Lipschitz functions directional Dini derivatives convexificators 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Maeda, T. 1994Constraint Qualifications in Multiobjective Optimization Problems: Differentiable CaseJournal of Optimization Theory and Applications80483500CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Preda, V., Chitescu, I. 1999On Constraint Qualifications in Multiobjective Optimization Problems: Semidifferentiable CaseJournal of Optimization Theory and Applications100417433CrossRefMathSciNetGoogle Scholar
  3. 3.
    Li, X. F. 1994Constraint Qualifications in Nonsmooth Multiobjective OptimizationJournal of Optimization Theory and Applications80483500CrossRefMathSciNetGoogle Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Demyanov, V. F., Jeyakumar, V. 1997Hunting for a Smaller Convex SubdifferentialJournal of Global Optimization10305326CrossRefMathSciNetGoogle Scholar
  6. 6.
    Jeyakumar, V., Luc, D. T. 1998Approximate Jacobian Matrices for NonSmooth Continuous Maps and C1-OptimizationSIAM Journal on Control and Optimization3618151832CrossRefMathSciNetGoogle Scholar
  7. 7.
    Jeyakumar, V., Luc, D. T., Schaible, S. 1998Characterizations of Generalized Monotone Nonsmooth Continuous Maps Using Approximate JacobiansJournal of Convex Analysis5119132MathSciNetGoogle Scholar
  8. 8.
    Jeyakumar, V., Luc, D. T. 1999Nonsmooth Calculus, Minimality, and Monotonicity of ConvexificatorsJournal of Optimization Theory and Applications101599621CrossRefMathSciNetGoogle Scholar
  9. 9.
    Jeyakumar, V., Wang, W. 1999Approximate Hessian Matrices and Second-Order Optimality Conditions for Nonlinear Programming Problems with C1-DataJournal of the Australian Mathematical Society40403420MathSciNetGoogle Scholar
  10. 10.
    Jeyakumar, V., Yang, X. Q. 1999Approximate Generalized Hessians and Taylor’s Expansions for Continuously Gateaux Differentiable FunctionsNonlinear Analysis: Theory, Methods, and Applications36353368MathSciNetGoogle Scholar
  11. 11.
    Wang, X., Jeyakumar, V. 2000A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality ConstraintsSIAM Journal on Optimization1011361148CrossRefMathSciNetGoogle Scholar
  12. 12.
    Uderzo, A. 2002Convex Approximators, Convexificators, and Exhausters: Application to Constrained Extremum ProblemKluwer Academic PublicationDordrecht Holland297327Quasidifferentiability and Related Topics, Nonconvex Optimization and Applications, Vol. 43Google Scholar
  13. 13.
    Dutta, J., Chandra, S. 2002Convexificators, Generalized Convexity, and Optimality ConditionsJournal of Optimization Theory and Application1134164MathSciNetGoogle Scholar
  14. 14.
    Luc, D. T. 2002A Multiplier Rule for Multiobjective Programming Problems with Continuous DataSIAM Journal on Optimization13168178CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Ursescu, C. 1982Tangent Sets Calculus and Necessary Conditions for ExtremalitySIAM Journal on Control and Optimization20563574CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Clarke, F. H. 1983Optimization and Nonsmooth AnalysisWiley-InterscienceNew York NYGoogle Scholar
  17. 17.
    Mangasarian, O. L. 1969Nonlinear ProgrammingMcGraw-HillNew York, NYGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • X. F. Li
    • 1
    • 2
  • J. Z. Zhang
    • 2
  1. 1.Department of MathematicsJilin UniversityChangchunP. R. China
  2. 2.Department of MathematicsCity University of Hong KongHong Kong

Personalised recommendations