Pages that link to "Item:Q4091361"
From MaRDI portal
The following pages link to A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation. (Q4091361):
Displayed 16 items.
- Fundamentals of cone regression (Q289730) (← links)
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation (Q2225528) (← links)
- The LP-Newton method for standard form linear programming problems (Q2450681) (← links)
- A gravitational interior point method for LP. (Q2476413) (← links)
- Low cardinality positive interior cubature on NURBS-shaped domains (Q2699046) (← links)
- An algorithm for least distance programming (Q3920551) (← links)
- A critical index algorithm for nearest point problems on simplicial cones (Q3937160) (← links)
- Finding the nearest point in A polytope (Q4123085) (← links)
- An update-and-stabilize framework for the minimum-norm-point problem (Q6085996) (← links)