Pages that link to "Item:Q3937160"
From MaRDI portal
The following pages link to A critical index algorithm for nearest point problems on simplicial cones (Q3937160):
Displaying 12 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)
- CP-rays in simplicial cones (Q811413) (← links)
- Projection onto simplicial cones by a semi-smooth Newton method (Q2341098) (← links)
- Projection onto simplicial cones by Picard's method (Q2348931) (← links)
- A gravitational interior point method for LP. (Q2476413) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)
- An algorithm for projecting onto simplicial cones (Q5151504) (← links)
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming (Q5965342) (← links)