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

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

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

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 programsapproximation to a convex functionsandwich approximation

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem, Optimal objective function approximation for separable convex quadratic programming, Combinatorial algorithms for some 1-facility median problems in the plane, Sequence of polyhedral relaxations for nonlinear univariate functions, Multiple objective minimum cost flow problems: a review, Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models, Unnamed Item, Finding representative systems for discrete bicriterion optimization problems, The convergence rate of the sandwich algorithm for approximating convex functions, Approximation in p-norm of univariate concave functions, A method for approximating pairwise comparison matrices by consistent matrices, Models and solution techniques for production planning problems with increasing byproducts, The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves, An optimal adaptive algorithm for the approximation of concave functions, Multiple objective programming with piecewise linear functions, Error bounds for the approximative solution of restricted planar location problems, A fractional model for locating semi-desirable facilities on networks, Approximation of convex sets by polytopes, How Good is the Chord Algorithm?, Unnamed Item, A method for convex curve approximation, 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