Successive approximation in separable programming: An improved procedure for convex separable programs
From MaRDI portal
Publication:3730353
DOI10.1002/nav.3800330213zbMath0596.90074MaRDI QIDQ3730353
Publication date: 1986
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800330213
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
90C55: Methods of successive quadratic programming type
Related Items
Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions, A branch-and-bound approach for spare unit allocation in a series system, Optimal objective function approximation for separable convex quadratic programming, Sandwich approximation of univariate convex functions with an application to separable convex programming
Cites Work