Iterative bundle-based decomposition for large-scale nonseparable convex optimization

DOI10.1016/S0377-2217(97)00350-0MaRDI QIDQ1806873zbMATH OpenFDO

Authors Koohyun Park, Yong-Sik Shin

Publication date 14 June 2000

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

zbMATH Keywords

optimizationquadratic programmingmathematical programmingnonlinear programmingconvex programming

Mathematics Subject Classification ID

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

Recommendations

• Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
• Publication:3741418
• New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
• New dual-type decomposition algorithm for non-convex separable optimization problems

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3846333 (Why is no real title available?)
• scientific article; zbMATH DE number 3976778 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A globally convergent method for nonlinear programming
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
• Bundle-based decomposition: Conditions for convergence
• Convex Analysis
• Network flows. Theory, algorithms, and applications.
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems

Cited in

(4)

• Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
• scientific article; zbMATH DE number 3976778 (Why is no real title available?)
• Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
• Fast inexact decomposition algorithms for large-scale separable convex optimization

This page was built for publication: Iterative bundle-based decomposition for large-scale nonseparable convex optimization

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