Approximate methods for convex minimization problems with series-parallel structure

DOI10.1016/j.ejor.2006.04.052zbMath1146.90048OpenAlexW2062750882MaRDI QIDQ2482762

Boris Rozin, Yuri Levin, Adi Ben-Israel, Genrikh Levin

Publication date: 24 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.052

zbMATH Keywords

decompositionlarge-scale optimizationconvex programming

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items (1)

Proximal point algorithms for nonsmooth convex optimization with fixed point constraints

Cites Work

• Unnamed Item
• Unnamed Item
• The Newton bracketing method for the minimization of convex functions subject to affine constraints
• Generalized inverses. Theory and applications.
• Directional Newton methods in $n$ variables
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Newton bracketing method for convex minimization.

This page was built for publication: Approximate methods for convex minimization problems with series-parallel structure