Optimal objective function approximation for separable convex quadratic programming

DOI10.1007/BF01582218zbMath0820.90081OpenAlexW2060676537MaRDI QIDQ1340073

James G. Morris, Faruk Güder

Publication date: 26 September 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582218

zbMATH Keywords

optimal piecewise-linear approximation methodseparable convex quadratic programs

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (3)

A MILP formulation for generalized geometric programming using piecewise-linear approximations ⋮ A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints ⋮ An effective linear approximation method for separable programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving highly nonlinear convex separable programs using successive approximation
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• Two-Segment Separable Programming
• Computational aspects of two-segment separable programming
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Successive approximation in separable programming: An improved procedure for convex separable programs
• Secant approximation methods for convex optimization
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• On the Goldstein-Levitin-Polyak gradient projection method
• Objective function approximations in mathematical programming
• Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
• Estimate of the maximum error in best polynomial approximations
• An algorithm for approximating convex functions by means by first degree splines

This page was built for publication: Optimal objective function approximation for separable convex quadratic programming