Successive approximation in separable programming: An improved procedure for convex separable programs

DOI10.1002/NAV.3800330213MaRDI QIDQ3730353zbMATH OpenOpenAlexFDO

Authors Lakshman S. Thakur

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

zbMATH Keywords

general convex separable programspiecewise linear programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Recommendations

• Solving highly nonlinear convex separable programs using successive approximation
• scientific article; zbMATH DE number 713582
• A two-segment approximation algorithm for separable convex programming with linear constraints
• Separable programming. Theory and methods
• scientific article; zbMATH DE number 3916036

Cites work

• Solving highly nonlinear convex separable programs using successive approximation

Cited in

(15)

• An effective linear approximation method for separable programming problems
• Solving highly nonlinear convex separable programs using successive approximation
• Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming
• 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
• On the constructive solution of convex programming problems in separable form
• A global optimization method for nonconvex separable programming problems
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• A MILP formulation for generalized geometric programming using piecewise-linear approximations
• A two-segment approximation algorithm for separable convex programming with linear constraints
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• scientific article; zbMATH DE number 713582 (Why is no real title available?)
• Separable optimization. Theory and methods
• Separable programming. Theory and methods

This page was built for publication: Successive approximation in separable programming: An improved procedure for convex separable programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730353)