Epsilon-proximal decomposition method

DOI10.1007/s10107-003-0371-0zbMath1082.90088OpenAlexW2036987405MaRDI QIDQ1424289

Adam Ouorou

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0371-0

zbMATH Keywords

convex optimizationdecompositioncutting planesmulticommodity flowsproximal point algorithmslarge-scale programming

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Monotone operators and generalizations (47H05) Approximation methods and heuristics in mathematical programming (90C59) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (6)

Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems ⋮ An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization ⋮ On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm ⋮ A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework ⋮ A geometric characterization of ``optimality-equivalent relaxations ⋮ An inexact method of partial inverses and a parallel bundle method

This page was built for publication: Epsilon-proximal decomposition method