Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
From MaRDI portal
Publication:6066599
DOI10.1111/itor.12374OpenAlexW2587691944MaRDI QIDQ6066599
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12374
penalized optimization problemsaddle point criteriaexact absolute value penalty function methodgeneralized Karush-Kuhn-Tucker necessary optimality conditionslocally Lipschitz \(( {\Phi}, \rho )\)-invex function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact penalty functions method for mathematical programming problems involving invex functions
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Lipschitz B-vex functions and nonsmooth programming
- On sufficiency and duality for \((b,F,\rho)\)-convex multiobjective programs
- Characterizations for perturbed exact penalty functions
- Strong and Weak Convexity of Sets and Functions
- (Φ, ρ)-Invexity in Nonsmooth Optimization
- Nonsmooth invexity
- Optimization and nonsmooth analysis
- Exact penalty functions in nonlinear programming
- Invex functions and constrained local minima
- Further Generalizations of Convexity in Mathematical Programming
- On optimality conditions in nondifferentiable programming
- A lower bound for the controlling parameters of the exact penalty functions
- Nonsmooth Invexity in Multiobjective Programming
- An exact penalty function for nonlinear programming with inequalities
- Exact Penalty Functions in Constrained Optimization
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
- Sufficiency of Exact Penalty Minimization
- Non-Linear Programming Via Penalty Functions
This page was built for publication: Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
