Pages that link to "Item:Q1611003"

The following pages link to Nonlinear rescaling vs. smoothing technique in convex optimization (Q1611003):

Displaying 34 items.

• Smooth minimization of non-smooth functions (Q128676) (← links)
• A class of nonlinear Lagrangians for nonconvex second order cone programming (Q540625) (← links)
• Saddle points of general augmented Lagrangians for constrained nonconvex optimization (Q695341) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property (Q721143) (← links)
• Unified theory of augmented Lagrangian methods for constrained global optimization (Q839330) (← links)
• Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
• Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← links)
• A re-scaled twin augmented Lagrangian algorithm for saddle point seeking (Q960238) (← links)
• Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints (Q983712) (← links)
• The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization (Q1004224) (← links)
• Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones (Q1023315) (← links)
• Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
• Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization (Q2029687) (← links)
• On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints (Q2269590) (← 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)
• Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
• Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
• A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem (Q2696923) (← 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)
• Bases for some reciprocity algebras I (Q3443135) (← links)
• A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM (Q3526524) (← links)
• Nonlinear rescaling Lagrangians for nonconvex semidefinite programming (Q5169465) (← links)
• (Q5417166) (← links)
• Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method (Q5436910) (← links)
• Primal–dual exterior point method for convex optimization (Q5459822) (← links)
• Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)
• Dislocation hyperbolic kernel function (Q6620698) (← links)
• A note on the dislocation hyperbolic transformation function (Q6658470) (← links)