Nonlinear rescaling vs. smoothing technique in convex optimization

DOI10.1007/S101070100293zbMath1022.90014OpenAlexW2150126561MaRDI QIDQ1611003

Roman A. Polyak

Publication date: 27 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100293

zbMATH Keywords

dual problemlinear programmingconstrained optimizationChen-Harker-Kanzow-Smale smoothing functionlog-sigmoid multipliers method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (31)

Bases for some reciprocity algebras I ⋮ A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ Unified theory of augmented Lagrangian methods for constrained global optimization ⋮ Primal-dual nonlinear rescaling method for convex optimization ⋮ Nonlinear rescaling as interior quadratic prox method in convex optimization ⋮ The Legendre Transformation in Modern Optimization ⋮ A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem ⋮ A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM ⋮ An entire space polynomial-time algorithm for linear programming ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ Support vector machine via nonlinear rescaling method ⋮ A re-scaled twin augmented Lagrangian algorithm for saddle point seeking ⋮ Nonlinear rescaling Lagrangians for nonconvex semidefinite programming ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ Primal-dual nonlinear rescaling method with dynamic scaling parameter update ⋮ On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints ⋮ Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method ⋮ Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ Dual convergence of the proximal point method with Bregman distances for linear programming ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ Double-regularization proximal methods, with complementarity applications ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ Smooth minimization of non-smooth functions ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ Primal–dual exterior point method for convex optimization ⋮ Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ Unnamed Item ⋮ Lagrangian transformation and interior ellipsoid methods in convex optimization

This page was built for publication: Nonlinear rescaling vs. smoothing technique in convex optimization