The convergence rate of the sandwich algorithm for approximating convex functions

DOI10.1007/BF02238642zbMath0787.65006OpenAlexW2109764733MaRDI QIDQ1195962

Günter Rote

Publication date: 11 January 1993

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

convex functionsandwich algorithmconvergence rateinterval bisectionchord rulemaximum error ruleslope bisection

Mathematics Subject Classification ID

Approximation with constraints (41A29) Algorithms for approximation of functions (65D15) Convexity of real functions in one variable, generalizations (26A51)

Related Items

Combinatorial algorithms for some 1-facility median problems in the plane, Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures, An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems, Sandwich approximation of univariate convex functions with an application to separable convex programming, An efficient and safe framework for solving optimization problems, Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions, Learning smooth shapes by probing, Convergence-order analysis of branch-and-bound algorithms for constrained problems, Constrained optimization using multiple objective programming, Approximation in p-norm of univariate concave functions, 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, A polyhedral branch-and-cut approach to global optimization, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, 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?, Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time, A method for convex curve approximation, Approximation of convex curves with application to the bicriterial minimum cost flow problem, Approximation methods for non-convex curves, Unnamed Item, Vector equilibrium problem and vector optimization, Interactive Multiple Criteria Decision Making for Large-Scale Multi-Objective Optimization Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal sequential algorithm for the uniform approximation of convex functions on \([0,1^ 2\)]
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives
• Approximation of convex bodies by polytopes
• Simultaneous inner and outer approximation of shapes
• Deterministic and stochastic error bounds in numerical analysis
• Polygonal approximation of plane convex bodies
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Polygonal approximation by the minimax method
• On the Optimal Solution of Large Linear Systems
• Shape from probing
• Bicriteria Transportation Problem
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Optimal Inscribed Polygons in Convex Curves
• Convex Analysis
• Optimal Curve Fitting With Piecewise Linear Functions