Pages that link to "Item:Q1195962"

The following pages link to The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962):

Displaying 20 items.

• Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions (Q346291) (← links)
• An efficient and safe framework for solving optimization problems (Q861905) (← links)
• Learning smooth shapes by probing (Q871061) (← links)
• Constrained optimization using multiple objective programming (Q878220) (← links)
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
• A method for convex curve approximation (Q1278603) (← links)
• Combinatorial algorithms for some 1-facility median problems in the plane (Q1342072) (← links)
• Vector equilibrium problem and vector optimization (Q1610182) (← links)
• Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
• A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
• Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
• Approximation methods for non-convex curves (Q1847152) (← links)
• Approximation in p-norm of univariate concave functions (Q2247899) (← links)
• Models and solution techniques for production planning problems with increasing byproducts (Q2250099) (← links)
• Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures (Q2376120) (← links)
• The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves (Q2480973) (← links)
• An optimal adaptive algorithm for the approximation of concave functions (Q2492698) (← links)
• Approximation of convex sets by polytopes (Q2519248) (← links)
• How Good is the Chord Algorithm? (Q2816293) (← links)