Long-step surrogate subgradient methods for convex feasibility problems

MaRDI QIDQ4233330zbMATH OpenFDO

Authors Bożena Łopuch, Krzysztof C. Kiwiel

Publication date 16 March 1999

zbMATH Keywords

closed convex setscommon pointsconvex feasibility problemHilbert spacesubgradient methods

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 1070394
• Long-step strategies in interior-point primal-dual methods
• On the long-step path-following method for semidefinite programming
• A long-step barrier method for convex quadratic programming
• Subgradient projection algorithms and approximate solutions of convex feasibility problems
• scientific article; zbMATH DE number 7604747
• An optimal subgradient algorithm for large-scale bound-constrained convex optimization
• Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
• Subgradient method with feasible inexact projections for constrained convex optimization problems
• Subgradient methods for huge-scale optimization problems

Cited in

(2)

• scientific article; zbMATH DE number 1070394 (Why is no real title available?)
• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems

This page was built for publication: Long-step surrogate subgradient methods for convex feasibility problems

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