Proximal point nonlinear rescaling method for convex optimization
From MaRDI portal
Publication:428983
DOI10.3934/NACO.2011.1.283zbMATH Open1268.90046OpenAlexW2316829046MaRDI QIDQ428983FDOQ428983
Publication date: 25 June 2012
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2011.1.283
Recommendations
- Nonlinear rescaling as interior quadratic prox method in convex optimization
- Nonlinear rescaling and proximal-like methods in convex optimization
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Primal-dual nonlinear rescaling method for convex optimization
- Rescaled proximal methods for linearly constrained convex problems
Cited In (14)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- A re-scaled twin augmented Lagrangian algorithm for saddle point seeking
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Title not available (Why is that?)
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Computing proximal points of nonconvex functions
- Nonlinear rescaling as interior quadratic prox method in convex optimization
- Primal-dual nonlinear rescaling method for convex optimization
- Strict convex regularizations, proximal points and augmented lagrangians
- Nonlinear rescaling in discrete minimax
- The Legendre Transformation in Modern Optimization
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- Rescaled pure greedy algorithm for convex optimization
This page was built for publication: Proximal point nonlinear rescaling method for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428983)
