Pages that link to "Item:Q1363410"

The following pages link to Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410):

Displaying 33 items.

• Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
• A class of nonlinear Lagrangians for nonconvex second order cone programming (Q540625) (← links)
• Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163) (← links)
• Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach (Q779763) (← links)
• Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
• Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← links)
• Augmented Lagrangian applied to convex quadratic problems (Q932544) (← links)
• Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones (Q1023315) (← links)
• On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
• How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
• Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• Second-order multiplier iteration based on a class of nonlinear Lagrangians (Q1722349) (← links)
• A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem (Q1734367) (← links)
• The Newton modified barrier method for QP problems (Q1915923) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
• A nonlinear Lagrangian based on Fischer-Burmeister NCP function (Q2372014) (← links)
• An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
• Support vector machine via nonlinear rescaling method (Q2468778) (← links)
• 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization (Q2481366) (← links)
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems (Q2487472) (← links)
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
• Decomposition for structured convex programs with smooth multiplier methods (Q2572336) (← links)
• Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach (Q2669712) (← links)
• The Legendre Transformation in Modern Optimization (Q2957720) (← links)
• A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
• A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
• Exponential augmented Lagrangian methods for equilibrium problems (Q5038182) (← links)
• On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization (Q5208730) (← links)
• (Q5417166) (← links)
• Dual Space Preconditioning for Gradient Descent (Q5857297) (← links)
• Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization (Q6181243) (← links)