Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
From MaRDI portal
Publication:5704156
DOI10.1287/moor.1030.0062zbMath1082.90087OpenAlexW2129765420MaRDI QIDQ5704156
Alfred Auslender, Marc Teboulle
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1030.0062
convex programmingbundle methodsprojected gradient methodssubgradient algorithmslogarithmic-quadratic proximal methodsnondifferentiable convex optimization
Related Items
The interior proximal extragradient method for solving equilibrium problems ⋮ Inexact subgradient methods for quasi-convex optimization problems ⋮ Convergence of inexact quasisubgradient methods with extrapolation ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming ⋮ A simplified view of first order methods for optimization ⋮ An optimal variant of Kelley's cutting-plane method ⋮ Convergence of the exponentiated gradient method with Armijo line search ⋮ Primal-dual \(\varepsilon\)-subgradient method for distributed optimization ⋮ An LQP-based two-step method for structured variational inequalities ⋮ A self-adaptive descent LQP alternating direction method for the structured variational inequalities ⋮ Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ Nonmonotone projected gradient methods based on barrier and Euclidean distances ⋮ Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints ⋮ An introduction to continuous optimization for imaging ⋮ A minimization algorithm for equilibrium problems with polyhedral constraints ⋮ On global subdifferentials with applications in nonsmooth optimization ⋮ Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ Optimization and learning with nonlocal calculus ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ Distributed optimization with inexact oracle
