Nonlinear rescaling and proximal-like methods in convex optimization
From MaRDI portal
Publication:1363410
DOI10.1007/BF02614440zbMath0882.90106OpenAlexW2050310885MaRDI QIDQ1363410
Marc Teboulle, Roman A. Polyak
Publication date: 10 March 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614440
convergence propertiesconvex constrained optimizationnonlinear rescaling principleentropy-like proximal methodsexponential penalty-modified barrier functions methods
Related Items
Exponential augmented Lagrangian methods for equilibrium problems, A nonlinear Lagrangian based on Fischer-Burmeister NCP function, Primal-dual nonlinear rescaling method for convex optimization, A simplified view of first order methods for optimization, How to deal with the unbounded in optimization: Theory and algorithms, Nonlinear rescaling as interior quadratic prox method in convex optimization, The Newton modified barrier method for QP problems, Subgradient method with entropic projections for convex nondifferentiable minimization, Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach, The Legendre Transformation in Modern Optimization, Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization, Modified Lagrangian methods for separable optimization problems, An entire space polynomial-time algorithm for linear programming, Second-order multiplier iteration based on a class of nonlinear Lagrangians, Augmented Lagrangian applied to convex quadratic problems, A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, Support vector machine via nonlinear rescaling method, 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization, A class of nonlinear Lagrangians for nonconvex second order cone programming, Numerical comparison of augmented Lagrangian algorithms for nonconvex problems, Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization., Primal-dual nonlinear rescaling method with dynamic scaling parameter update, A new family of penalties for augmented Lagrangian methods, On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization, Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones, On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization, Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach, Decomposition for structured convex programs with smooth multiplier methods, Dual Space Preconditioning for Gradient Descent, An exterior point polynomial-time algorithm for convex quadratic programming, Unnamed Item, Lagrangian transformation and interior ellipsoid methods in convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Modified barrier functions (theory and methods)
- Asymptotic behavior of nonexpansive mappings
- A cubic extended interior penalty function for structural optimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- On implementation of the extended interior penalty function
- Applications of a Quadratic Extended Interior for Structural Optimization Penalty Function
- Monotone Operators and the Proximal Point Algorithm
- The convergence of a modified barrier method for convex programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
