Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs

DOI10.1007/BF01581138zbMATH Open0830.90120MaRDI QIDQ1338136FDOQ1338136

Deepankar Medhi

Publication date: 30 January 1996

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

zbMATH Keywords

convex optimizationerror estimateduality gapbundle methodnonsmooth concave problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A stable method for solving certain constrained least squares problems
• Convex Analysis
• Monotone Operators and the Proximal Point Algorithm
• Validation of subgradient optimization
• Decomposition Principle for Linear Programs
• 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 (4)

• The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
• 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

• IMSL Numerical Libraries
• MINOS

Recommendations

• Approximations in proximal bundle methods and decomposition of convex programs 👍 👎
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems 👍 👎
• Iterative bundle-based decomposition for large-scale nonseparable convex optimization 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)