The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
From MaRDI portal
Publication:4876723
DOI10.1137/0334031zbMath0846.90084OpenAlexW2061597864MaRDI QIDQ4876723
Publication date: 6 May 1996
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0334031
convex optimizationparallel computingnondifferentiable optimizationlinear inequalitiessubgradient methodsrelaxation methodssuccessive projections
Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05)
Related Items (22)
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions ⋮ A steepest descent-like method for vector optimization problems with variable domination structure ⋮ Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ Variable target value relaxed alternating projection method ⋮ Approximate level method for nonsmooth convex minimization ⋮ Two-step projection methods for a system of variational inequality problems in Banach spaces ⋮ Projection methods for the linear split feasibility problems ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ Variant gradient projection methods for the minimization problems ⋮ A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence ⋮ A steepest descent-like method for variable order vector optimization problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems ⋮ Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures ⋮ Obtuse cones and Gram matrices with non-negative inverse ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems ⋮ Residual Selection in A Projection Method for Convex Minimization Problems ⋮ Scaling Techniques for $\epsilon$-Subgradient Methods ⋮ Cases of ineffectiveness of geometric cuts in sequential projection methods ⋮ Efficiency of proximal bundle methods ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems
This page was built for publication: The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
