A two-segment approximation algorithm for separable convex programming with linear constraints

DOI10.1080/02331938608843114MaRDI QIDQ3724100zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938608843114

zbMATH Keywords

approximation of the objective functionComputational testslinear constraintsseparable convex programmingsequence of feasible solutionstwo-segment approximation

Mathematics Subject Classification ID

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

Recommendations

• Successive approximation in separable programming: An improved procedure for convex separable programs
• Algorithms to solve some problems of concave programming with linear constraints
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• scientific article; zbMATH DE number 713582
• Separable programming. Theory and methods

Cites work

• Convex Analysis
• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• Two-Segment Separable Programming

Cited in

(8)

• A nonliner congestion network model for planning internal movement in the Hajj
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Optimal objective function approximation for separable convex quadratic programming
• On the constructive solution of convex programming problems in separable form
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• Successive approximation in separable programming: An improved procedure for convex separable programs
• Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
• Sandwich approximation of univariate convex functions with an application to separable convex programming

This page was built for publication: A two-segment approximation algorithm for separable convex programming with linear constraints

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