Pages that link to "Item:Q694540"
From MaRDI portal
The following pages link to The nearest point problem in a polyhedral set and its extensions (Q694540):
Displaying 10 items.
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- Porosity results for two-set nearest and farthest point problems (Q903072) (← links)
- Projection onto simplicial cones by a semi-smooth Newton method (Q2341098) (← links)
- Projection onto simplicial cones by Picard's method (Q2348931) (← links)
- ON ALMOST WELL-POSED MUTUALLY NEAREST AND MUTUALLY FURTHEST POINT PROBLEMS (Q3148353) (← links)
- On nearest points in closed convex sets (Q4386125) (← links)
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones (Q4698235) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming (Q5965342) (← links)
