Exact penalty functions method for mathematical programming problems involving invex functions
From MaRDI portal
Publication:1027576
DOI10.1016/j.ejor.2008.07.031zbMath1163.90792OpenAlexW2022042964MaRDI QIDQ1027576
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.031
Karush-Kuhn-Tucker optimality conditionsexact penalty function methodabsolute value penalty functionpenalized optimization probleminvex function with respect to \(\eta\)
Related Items
An exact \(l_1\) penalty approach for interval-valued programming problem ⋮ Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function ⋮ The study of certain optimization problems via variational inequalities ⋮ On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems ⋮ Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems ⋮ The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems ⋮ G-penalty approach for multi-dimensional control optimisation problem with nonlinear dynamical system ⋮ Solving invex multitime control problems with first‐order PDE constraints via the absolute value exact penalty method ⋮ A new exact exponential penalty function method and nonconvex mathematical programming ⋮ On nondifferentiable semi-infinite multiobjective programming with interval-valued functions ⋮ A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems ⋮ Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems ⋮ A new class of exact penalty functions and penalty algorithms ⋮ New exact penalty functions for nonlinear constrained optimization problems ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ Robust penalty function method for an uncertain multi-time control optimization problems ⋮ THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS ⋮ An exact \(l_1\) penalty function method for multi-dimensional first-order PDE constrained control optimization problem ⋮ Invex programming problems with equality and inequality constraints ⋮ An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods ⋮ Robust saddle-point criteria for multi-dimensional control optimisation problems with data uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The essence of invexity
- Enlarging the region of convergence of Newton's method for constrained optimization
- On sufficiency of the Kuhn-Tucker conditions
- Generalized B-vex functions and generalized B-vex programming
- A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- What is invexity?
- A class of nonconvex functions and mathematical programming
- Invex functions and constrained local minima
- A lower bound for the controlling parameters of the exact penalty functions
- An exact penalty function for nonlinear programming with inequalities
- Exact Penalty Functions in Constrained Optimization
- Sufficiency of Exact Penalty Minimization
- Non-Linear Programming Via Penalty Functions
- An Exact Potential Method for Constrained Maxima
- Constrained Optimization Using a Nondifferentiable Penalty Function
- Exact penalty functions in nonlinear programming
- \((p,r)\)-invex sets and functions
