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

DOI10.1016/S0377-2217(97)00350-0zbMath0937.90080MaRDI QIDQ1806873

Yong-Sik Shin, Koohyun Park

Publication date: 14 June 2000

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

zbMATH Keywords

optimizationquadratic programmingconvex programmingnonlinear programmingmathematical programming

Mathematics Subject Classification ID

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

Cites Work

• Bundle-based decomposition: Conditions for convergence
• A globally convergent method for nonlinear programming
• Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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