The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems

DOI10.1007/978-3-642-36062-6_46zbMath1266.49024OpenAlexW1437599971MaRDI QIDQ4927306

Tadeusz Antczak

Publication date: 19 June 2013

Published in: IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36062-6_46

zbMATH Keywords

absolute value penalty functiongeneralized Karush-Kuhn-Tucker optimality conditionspenalized optimization problemexact \(l_1\) penalty function methodlocally Lipschitz invex function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Optimality conditions (49K99)

Related Items (9)

Minimum distance Lasso for robust high-dimensional regression ⋮ On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems ⋮ The minimax exact penalty fuzzy function method for solving convex nonsmooth optimization problems with fuzzy objective functions ⋮ Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems ⋮ Solving invex multitime control problems with first‐order PDE constraints via the absolute value exact penalty method ⋮ On nondifferentiable semi-infinite multiobjective programming with interval-valued functions ⋮ Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems ⋮ Vector exponential penalty function method for nondifferentiable multiobjective programming problems ⋮ Exact penalization in stochastic programming -- calmness and constraint qualification

This page was built for publication: The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems