Exact penalty method for minimizing of nonsmooth functions on convex sets

Research output

Abstract

© 2015 Vladimir V. Karelin, Dmitry M. Lebedev and Lyudmila N. Polyakova.This paper considers a constrained nonsmooth optimization problem in which an objective function is locally Lipschitz and constraint func- tions are convex. With the help of exact penalty functions this problem is transformed into an unconstrained one. A regularity condition under which there exists an exact penalty parameters is introduced. For its implementation it is necessary that functions defining constraints were nonsmooth at every boundary point of this set. It is shown that in some cases it is possible to find an analytic representation of an exact penalty parameter.
Original languageEnglish
Pages (from-to)6383-6390
JournalApplied Mathematical Sciences
Issue number128
DOIs
Publication statusPublished - 2015

Fingerprint Dive into the research topics of 'Exact penalty method for minimizing of nonsmooth functions on convex sets'. Together they form a unique fingerprint.

  • Cite this