Optimal objective function approximation for separable convex quadratic programming
type: Item
instance of: scholarly article
title: Optimal objective function approximation for separable convex quadratic programming
zbMATH Open document ID: 0820.90081
DOI: 10.1007/BF01582218
author: Faruk Güder
author: James G. Morris
published in: Mathematical Programming. Series A. Series B
publication date: 1995-09-26T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 700819
zbMATH Keywords: optimal piecewise-linear approximation method
zbMATH Keywords: separable convex quadratic programs
MaRDI profile type: Publication
cites work: Q3920955
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Sandwich approximation of univariate convex functions with an application to separable convex programming
cites work: An algorithm for approximating convex functions by means by first degree splines
cites work: A simplex algorithm for piecewise-linear programming I: Derivation and proof
cites work: A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
cites work: A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
cites work: Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
cites work: Objective function approximations in mathematical programming
cites work: Q5569992
cites work: Secant approximation methods for convex optimization
cites work: Two-Segment Separable Programming
cites work: Computational aspects of two-segment separable programming
cites work: Estimate of the maximum error in best polynomial approximations
cites work: Q3730336
cites work: Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
cites work: Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
cites work: Solving highly nonlinear convex separable programs using successive approximation
cites work: Successive approximation in separable programming: An improved procedure for convex separable programs
full work available at URL: https://doi.org/10.1007/bf01582218
OpenAlex ID: W2060676537
description: scientific article; zbMATH DE number 700819