The nearest point problem in a polyhedral set and its extensions
From MaRDI portal
Publication:694540
DOI10.1007/s10589-011-9448-5zbMath1259.90085OpenAlexW2070243420WikidataQ57430529 ScholiaQ57430529MaRDI QIDQ694540
Publication date: 12 December 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9448-5
Related Items
A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming, Projection onto simplicial cones by a semi-smooth Newton method, Projection onto simplicial cones by Picard's method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- An active index algorithm for the nearest point problem in a polyhedral cone
- A long-step barrier method for convex quadratic programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A successive projection method
- A modified projection algorithm for large strictly-convex quadratic programs
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- The Simplex Method for Quadratic Programming
- Randomly Generated Test Problems for Positive Definite Quadratic Programming
- An active set quadratic programming algorithm for real-time model predictive control
- A critical index algorithm for nearest point problems on simplicial cones
- An iterative method for generalized complementarity problems
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- Finding the nearest point in A polytope
- Bimatrix Equilibrium Points and Mathematical Programming
