Skip to main content

Advertisement

Log in

Optimality conditions in convex optimization with locally Lipschitz constraints

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we consider a convex optimization problem with locally Lipschitz inequality constraints. The KKT optimality conditions (both necessary and sufficient) for quasi \(\epsilon \)-solutions are established under Slater’s constraint qualification and a non-degeneracy condition. Moreover, we explore the optimality condition for weakly efficient solutions in multiobjective convex optimization involving locally Lipschitz constraints. Some examples are given to illustrate our results.

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. Clarke, F.H.: Optimization and Nonsmooth Analysis. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1990)

    Book  Google Scholar 

  2. Dhara, A., Dutta, J.: Optimality Conditions in Convex Optimization: A Finite-Dimensional View. CRC Press, Cambridge (2012)

    MATH  Google Scholar 

  3. Dutta, J., Lalitha, C.S.: Optimality conditions in convex optimization revisited. Optim. Lett. 7, 221–229 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)

    MATH  Google Scholar 

  5. Ekeland, I.: On the variational principle. J. Math. Anal. Appl. 47, 324–353 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jiao, L.G., Lee, J.H.: Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs. J. Optim. Theory Appl. 176, 74–93 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lasserre, J.B.: On representations of the feasible set in convex optimization. Optim. Lett. 4, 1–5 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lee, J.H., Jiao, L.G.: On quasi \(\epsilon \)-solution for robust convex optimization problems. Optim. Lett. 11, 1609–1622 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  9. Loridan, P.: Necessary conditions for \(\epsilon \)-optimality. Math. Program. Stud. 19, 140–152 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (2001)

    MATH  Google Scholar 

  11. Yamamoto, S., Kuroiwa, D.: Constraint qualifications for KKT optimality condition in convex optimization with locally Lipschitz inequalty constraints. Linear Nonlinear Anal. 2, 101–111 (2016)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to express their sincere thanks to anonymous referees for helpful suggestions and valuable comments for the paper. This work was supported by the National Research Foundation of Korea Grant funded by the Korean Government (NRF-2016R1A2B4011589).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Do Sang Kim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hong, Z., Bae, K.D. & Kim, D.S. Optimality conditions in convex optimization with locally Lipschitz constraints. Optim Lett 13, 1059–1068 (2019). https://doi.org/10.1007/s11590-018-1343-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-018-1343-x

Keywords

Navigation