An active index algorithm for the nearest point problem in a polyhedral cone
From MaRDI portal
Publication:548684
DOI10.1007/S10589-009-9303-0zbMATH Open1222.90042DBLPjournals/coap/LiuF11OpenAlexW1998488583WikidataQ57435687 ScholiaQ57435687MaRDI QIDQ548684FDOQ548684
Publication date: 30 June 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9303-0
Recommendations
- The nearest point problem in a polyhedral set and its extensions
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
- An algorithm for solving the nearest point problem in an affine subspace
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
Cites Work
- CONV_QP
- A numerically stable dual method for solving strictly convex quadratic programs
- Title not available (Why is that?)
- Bimatrix Equilibrium Points and Mathematical Programming
- Finding the nearest point in A polytope
- A successive projection method
- A critical index algorithm for nearest point problems on simplicial cones
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- An iterative method for generalized complementarity problems
- A modified projection algorithm for large strictly-convex quadratic programs
- Title not available (Why is that?)
- A new practically efficient interior point method for LP
- A long-step barrier method for convex quadratic programming
Cited In (8)
- The nearest point problem in a polyhedral set and its extensions
- An algorithm for projecting onto simplicial cones
- Fundamentals of cone regression
- The distance between convex sets with Minkowski sum structure: application to collision detection
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
Uses Software
This page was built for publication: An active index algorithm for the nearest point problem in a polyhedral cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548684)
