Solving highly nonlinear convex separable programs using successive approximation
From MaRDI portal
Publication:1089265
DOI10.1016/0305-0548(69)90005-7zbMath0618.90078MaRDI QIDQ1089265
Publication date: 1984
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(69)90005-7
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C55: Methods of successive quadratic programming type
Related Items
Global multi-parametric optimal value bounds and solution estimates for separable parametric programs, Optimal objective function approximation for separable convex quadratic programming, Successive approximation in separable programming: An improved procedure for convex separable programs
Cites Work
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
- Two-Segment Separable Programming
- Global Minimization in Nonconvex All-Quadratic Programming
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item