The projected subgradient algorithm in convex optimization

DOI10.1007/978-3-030-60300-7MaRDI QIDQ5139371zbMATH OpenOpenAlexFDO

Authors 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

computational errorsnonsmooth convex optimizationquasiconvex optimizationsubgradient projection methodzero-sum games

Mathematics Subject Classification ID

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

Recommendations

• Convex optimization with computational errors
• Numerical optimization with computational errors
• Optimization on solution sets of common fixed point problems
• The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
• Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

Cited in

(19)

• Extensions of subgradient projection algorithms
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Numerical optimization with computational errors
• scientific article; zbMATH DE number 447429 (Why is no real title available?)
• The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
• scientific article; zbMATH DE number 11412 (Why is no real title available?)
• scientific article; zbMATH DE number 29728 (Why is no real title available?)
• scientific article; zbMATH DE number 6307098 (Why is no real title available?)
• scientific article; zbMATH DE number 7352424 (Why is no real title available?)
• Optimization on solution sets of common fixed point problems
• Subgradient method with feasible inexact projections for constrained convex optimization problems
• Optimization in Banach spaces
• Convex optimization with computational errors
• scientific article; zbMATH DE number 5060354 (Why is no real title available?)
• Subgradient algorithm for computing contraction metrics for equilibria
• An accelerated version of block cyclic subgradient projection method for solving convex feasibility problems
• Preface to the special issue dedicated to Dr. Alexander J. Zaslavski on his 65th birthday
• Robust personalized pricing under uncertainty of purchase probabilities
• Inexact quantized quasi-subgradient method for quasi-convex optimization problems

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)