Pages that link to "Item:Q5184681"
From MaRDI portal
The following pages link to Sufficiency of Exact Penalty Minimization (Q5184681):
Displaying 35 items.
- The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (Q331995) (← links)
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems (Q409835) (← links)
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems (Q440840) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- Second-order analysis of penalty function (Q604260) (← links)
- A new exact exponential penalty function method and nonconvex mathematical programming (Q632914) (← links)
- Exact penalty functions method for mathematical programming problems involving invex functions (Q1027576) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions (Q1199753) (← links)
- On invexity-type nonlinear programming problems (Q1321449) (← links)
- Duality of regularizations and hullfunctions for mathematical programming problems (Q1342426) (← links)
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems (Q1706415) (← links)
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems (Q1746707) (← links)
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming (Q1806494) (← links)
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics (Q2327803) (← links)
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints (Q2365344) (← links)
- A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems (Q2435021) (← links)
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization (Q2438407) (← links)
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions (Q2691484) (← links)
- A unifying theory of exactness of linear penalty functions (Q2810116) (← links)
- The Exactness Property of the Vector Exact <i>l</i><sub>1</sub> Penalty Function Method in Nondifferentiable Invex Multiobjective Programming (Q2964199) (← links)
- THE l<sub>1</sub> PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS (Q3069758) (← links)
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging (Q3188209) (← links)
- Nonsmooth Optimization (Q3569504) (← links)
- An exact lower order penalty function and its smoothing in nonlinear programming (Q4656058) (← links)
- An $L^1$ Penalty Method for General Obstacle Problems (Q5264051) (← links)
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems (Q5409739) (← links)
- Linear programming with nonparametric penalty programs and iterated thresholding (Q5882227) (← links)
- On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems (Q6059887) (← links)
- Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems (Q6066599) (← links)
- Convergence rate estimates for penalty methods revisited (Q6133302) (← links)
- Solving invex multitime control problems with first‐order PDE constraints via the absolute value exact penalty method (Q6180300) (← links)