Pages that link to "Item:Q1195962"
From MaRDI portal
The following pages link to The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962):
Displaying 7 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)
- 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)
