Skip to main content
Log in

Approximate Karush–Kuhn–Tucker Condition in Multiobjective Optimization

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

Abstract

We extend the so-called approximate Karush–Kuhn–Tucker condition from a scalar optimization problem with equality and inequality constraints to a multiobjective optimization problem. We prove that this condition is necessary for a point to be a local weak efficient solution without any constraint qualification, and is also sufficient under convexity assumptions. We also state that an enhanced Fritz John-type condition is also necessary for local weak efficiency, and under the additional quasi-normality constraint qualification becomes an enhanced Karush–Kuhn–Tucker condition. Finally, we study some relations between these concepts and the notion of bounded approximate Karush–Kuhn–Tucker condition, which is introduced in this paper.

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. Kortanek, K.O., Evans, J.P.: Asymptotic Lagrange regularity for pseudoconcave programming with weak constraint qualification. Oper. Res. 16, 849–857 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  2. Fiacco, A.V., McCormick, G.P.: The slacked unconstrained minimization technique for convex programming. SIAM J. Appl. Math. 15, 505–515 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  3. Zlobec, S.: Extensions of asymptotic Kuhn–Tucker conditions in mathematical programming. SIAM J. Appl. Math. 21, 448–460 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hestenes, M.R.: Optimization Theory: The Finite Dimensional Case. Wiley, New York (1975)

    MATH  Google Scholar 

  5. McShane, E.J.: The Lagrange multiplier rule. Am. Math. Mon. 80, 922–925 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  6. Craven, B.D.: Modified Kuhn–Tucker conditions when a minimum is not attained. Oper. Res. Lett. 3, 47–52 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Trudzik, L.I.: Asymptotic Kuhn–Tucker conditions in abstract spaces. Numer. Funct. Anal. Optim. 4, 355–369 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  8. Haeser, G., Schuverdt, M.L.: On approximate KKT condition and its extension to continuous variational inequalities. J. Optim. Theory Appl. 149, 528–539 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Andreani, R., Haeser, G., Martínez, J.M.: On sequential optimality conditions for smooth constrained optimization. Optimization 60, 627–641 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Andreani, R., Martínez, J.M., Svaiter, B.F.: A new sequential optimality condition for constrained optimization and algorithmic consequences. SIAM J. Optim. 20, 3533–3554 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Dutta, J., Deb, K., Tulshyan, R., Arora, R.: Approximate KKT points and a proximity measure for termination. J. Glob. Optim. 56, 1463–1499 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Haeser, G., Melo, V.V.: Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available. Oper. Res. Lett. 43, 484–488 (2015)

    Article  MathSciNet  Google Scholar 

  13. Bertsekas, D.P., Ozdaglar, A.E.: Pseudonormality and a Lagrange multiplier theory for constrained optimization. J. Optim. Theory Appl. 114, 287–343 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    MATH  Google Scholar 

  15. Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)

    MATH  Google Scholar 

  16. Andreani, R., Martínez, J.M., Schuverdt, M.L.: On the relation between constant positive linear dependence condition and quasinormality constraint qualification. J. Optim. Theory Appl. 125, 473–483 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research was partially supported (for the second and third author) by the Ministerio de Economía y Competitividad (Spain) under project MTM2012-30942. The authors are grateful to the associate editor and the anonymous referees for their helpful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vicente Novo.

Additional information

Communicated by Fabian Flores-Bazán.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Giorgi, G., Jiménez, B. & Novo, V. Approximate Karush–Kuhn–Tucker Condition in Multiobjective Optimization. J Optim Theory Appl 171, 70–89 (2016). https://doi.org/10.1007/s10957-016-0986-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-016-0986-y

Keywords

Mathematics Subject Classification

Navigation