Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
From MaRDI portal
Publication:1338136
DOI10.1007/BF01581138zbMATH Open0830.90120MaRDI QIDQ1338136FDOQ1338136
Publication date: 30 January 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- Iterative bundle-based decomposition for large-scale nonseparable convex optimization
- scientific article; zbMATH DE number 4027166
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- scientific article; zbMATH DE number 3976778
- Approximations in proximal bundle methods and decomposition of convex programs
Convex programming (90C25) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)
Cites Work
- A stable method for solving certain constrained least squares problems
- Convex Analysis
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Validation of subgradient optimization
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational experience with advanced implementation of decomposition algorithms for linear programming
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Computational aspects of DYNAMICO : a model of trade and development in the world economy
- DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
Cited In (6)
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- Bundle-based decomposition: Conditions for convergence
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Iterative bundle-based decomposition for large-scale nonseparable convex optimization
- Generalized proximal point algorithm for convex optimization
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
Uses Software
This page was built for publication: Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338136)
