Solving highly nonlinear convex separable programs using successive approximation

DOI10.1016/0305-0548(69)90005-7zbMath0618.90078OpenAlexW2040192492MaRDI QIDQ1089265

Lakshman S. Thakur

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

zbMATH Keywords

separable programmingsuccessive approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Related Items

Optimal objective function approximation for separable convex quadratic programming, A MILP formulation for generalized geometric programming using piecewise-linear approximations, Successive approximation in separable programming: An improved procedure for convex separable programs, Global multi-parametric optimal value bounds and solution estimates for separable parametric programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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