The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions

DOI10.1137/S0363012994261483zbMath0846.90085OpenAlexW2047092360MaRDI QIDQ4876724

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/s0363012994261483

zbMATH Keywords

nondifferentiable optimization parallel implementations linear inequalities relaxation methods surrogate constraints successive projections subgradient techniques efficiency estimates

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05)

Related Items (17)

On some difficult linear programs coming from set partitioning ⋮ Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ Approximate level method for nonsmooth convex minimization ⋮ Two-step projection methods for a system of variational inequality problems in Banach spaces ⋮ Asymptotics for some proximal-like method involving inertia and memory aspects ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ Variant gradient projection methods for the minimization problems ⋮ A variable target value method for nondifferentiable optimization ⋮ 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 ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ Obtuse cones and Gram matrices with non-negative inverse ⋮ 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 ⋮ 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 II: Implementations and Extensions