Pages that link to "Item:Q2704787"
From MaRDI portal
The following pages link to Simplicial algorithms for minimizing polyhedral functions (Q2704787):
Displaying 9 items.
- Near minimally normed spline quasi-interpolants on uniform partitions (Q557732) (← links)
- A simplicial algorithm for concave minimization and its performance as a heuristic tool (Q934181) (← links)
- An algebraic characterization of the optimum of regularized kernel methods (Q1009329) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Bernstein-Bézier representation and near-minimally normed discrete quasi-interpolation operators (Q2463603) (← links)
- (Q3221762) (← links)
- Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
- (Q4952659) (← links)
- Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming (Q5233243) (← links)