Pages that link to "Item:Q4339372"
From MaRDI portal
The following pages link to Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming (Q4339372):
Displaying 43 items.
- On the convergence of a smooth penalty algorithm without computing global solutions (Q411033) (← links)
- Dual convergence for penalty algorithms in convex programming (Q430935) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- A class of nonlinear Lagrangians for nonconvex second order cone programming (Q540625) (← links)
- Lagrangian regularization approach to constrained optimization problems (Q703420) (← links)
- Optimal planning of a multi-station system with sojourn time constraints (Q817147) (← links)
- Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← links)
- Penalty and barrier methods for convex semidefinite programming (Q883081) (← links)
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization (Q946337) (← links)
- On smoothing exact penalty functions for nonlinear constrained optimization problems (Q1032012) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- On a smoothed penalty-based algorithm for global optimization (Q1683321) (← links)
- Second-order multiplier iteration based on a class of nonlinear Lagrangians (Q1722349) (← links)
- Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
- Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
- Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems (Q1945504) (← links)
- Embedding equality constraints of optimization problems into a quantum annealer (Q2003330) (← links)
- Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization (Q2018997) (← links)
- Smoothing methods for nonlinear complementarity problems (Q2251565) (← links)
- An approximate penalty method with descent for convex optimization problems (Q2286954) (← links)
- On the central paths in symmetric cone programming (Q2359786) (← links)
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function (Q2372014) (← links)
- On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
- A geometric framework for nonconvex optimization duality using augmented Lagrangian functions (Q2481369) (← links)
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
- A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems (Q2666330) (← links)
- The Legendre Transformation in Modern Optimization (Q2957720) (← links)
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM (Q3526524) (← links)
- General primal-dual penalty/barrier path-following Newton methods for nonlinear programming (Q3534650) (← links)
- Lp approximation of variational problems in L1 and L∞ (Q4239805) (← links)
- Penalty functions with a small penalty parameter (Q4405947) (← links)
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems (Q4412389) (← links)
- Strict convex regularizations, proximal points and augmented lagrangians (Q4528235) (← links)
- Calmness of partially perturbed linear systems with an application to the central path (Q4634160) (← links)
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods (Q4916327) (← links)
- Global convergence and finite termination of a class of smooth penalty function algorithms (Q4924100) (← links)
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming (Q5169465) (← links)
- Primal–dual exterior point method for convex optimization (Q5459822) (← links)
- On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) (← links)
- Dual Space Preconditioning for Gradient Descent (Q5857297) (← links)
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications (Q5957151) (← links)
- Global convergence of a class new smooth penalty algorithm for constrained optimization problem (Q6093365) (← links)
- Enhanced computation of the proximity operator for perspective functions (Q6151588) (← links)
