Sandwich approximation of univariate convex functions with an application to separable convex programming

DOI10.1002/nav.3800380609zbMath0755.90066MaRDI QIDQ3987782

Horst W. Hamacher, Günter Rote, Rainer E. Burkard

Publication date: 28 June 1992

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800380609

zbMATH Keywords

separable convex programs; approximation to a convex function; sandwich approximation

Mathematics Subject Classification ID

90C25: Convex programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Error bounds for the approximative solution of restricted planar location problems, A fractional model for locating semi-desirable facilities on networks, The convergence rate of the sandwich algorithm for approximating convex functions, A method for convex curve approximation, Optimal objective function approximation for separable convex quadratic programming, Combinatorial algorithms for some 1-facility median problems in the plane, Approximation methods for non-convex curves

Cites Work

• Unnamed Item
• An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1^ 2\)]
• Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives
• Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
• The convergence rate of the sandwich algorithm for approximating convex functions
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Multipoint methods for separable nonlinear networks
• Polygonal approximation by the minimax method
• Computational aspects of two-segment separable programming
• Successive approximation in separable programming: An improved procedure for convex separable programs
• Bicriteria Transportation Problem
• Secant approximation methods for convex optimization
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• Objective function approximations in mathematical programming
• Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
• An algorithm for approximating convex functions by means by first degree splines