THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
From MaRDI portal
Publication:3069758
Recommendations
- The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
- On penalty function method for a class of nonconvex constrained optimization problems.
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- scientific article; zbMATH DE number 3934328
- Penalty methods for a class of non-Lipschitz optimization problems
- On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems
- scientific article; zbMATH DE number 4202028
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- A differentiable and ``almost exact penalty function method for nonlinear programming
- On a Lagrangian penalty function method for nonlinear programming problems
Cites work
- \((p,r)\)-invex sets and functions
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- A lower bound for the controlling parameters of the exact penalty functions
- A multiplier method with automatic limitation of penalty growth
- An exact penalty function for nonlinear programming with inequalities
- An exact penalty function method with global convergence properties for nonlinear programming problems
- An Exact Potential Method for Constrained Maxima
- Exact Penalty Functions in Constrained Optimization
- Exact penalty functions in nonlinear programming
- Exact penalty functions method for mathematical programming problems involving invex functions
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Non-Linear Programming Via Penalty Functions
- On conditions for optimality of the nonlinearl 1 problem
- On sufficiency of the Kuhn-Tucker conditions
- Sufficiency of Exact Penalty Minimization
Cited in
(10)- Penalization techniques in \(L^{\infty}\) optimization problems with unbounded horizon
- An exact \(l_1\) penalty approach for interval-valued programming problem
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
- The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
- On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems
- A new exact exponential penalty function method and nonconvex mathematical programming
- Exact l₁ exponential penalty approach for interval-valued mathematical problems
This page was built for publication: THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069758)
