Iterative bundle-based decomposition for large-scale nonseparable convex optimization
From MaRDI portal
Publication:1806873
DOI10.1016/S0377-2217(97)00350-0zbMATH Open0937.90080MaRDI QIDQ1806873FDOQ1806873
Publication date: 14 June 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- scientific article; zbMATH DE number 3976778
- 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
- Title not available (Why is that?)
- Convex Analysis
- Title not available (Why is that?)
- A globally convergent method for nonlinear programming
- Title not available (Why is that?)
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Title not available (Why is that?)
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Title not available (Why is that?)
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Bundle-based decomposition: Conditions for convergence
Cited In (4)
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Title not available (Why is that?)
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)
