The Projected Subgradient Algorithm in Convex Optimization

DOI10.1007/978-3-030-60300-7zbMATH Open1464.90063OpenAlexW3110018324MaRDI QIDQ5139371

Alexander J. Zaslavski

Publication date: 8 December 2020

Published in: SpringerBriefs in Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-60300-7

zbMATH Keywords

zero-sum gamessubgradient projection methodnonsmooth convex optimizationquasiconvex optimizationcomputational errors

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Methods of reduced gradient type (90C52)

Related Items (9)

Subgradient method with feasible inexact projections for constrained convex optimization problems ⋮ Extensions of subgradient projection algorithms ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Subgradient algorithm for computing contraction metrics for equilibria ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ On the projected subgradient method for nonsmooth convex optimization in a Hilbert space

This page was built for publication: The Projected Subgradient Algorithm in Convex Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139371)