The nearest point problem in a polyhedral set and its extensions
From MaRDI portal
Publication:694540
DOI10.1007/S10589-011-9448-5zbMATH Open1259.90085DBLPjournals/coap/LiuF12OpenAlexW2070243420WikidataQ57430529 ScholiaQ57430529MaRDI QIDQ694540FDOQ694540
Authors: Zhe Liu, Yahya Fathi 
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
Recommendations
- An active index algorithm for the nearest point problem in a polyhedral cone
- Exterior point algorithms for nearest points and convex quadratic programs
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
Cites Work
- The Simplex Method for Quadratic Programming
- 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.
- An active index algorithm for the nearest point problem in a polyhedral cone
- 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
- A new practically efficient interior point method for LP
- A long-step barrier method for convex quadratic programming
- Randomly Generated Test Problems for Positive Definite Quadratic Programming
- An active set quadratic programming algorithm for real-time model predictive control
Cited In (10)
- An active index algorithm for the nearest point problem in a polyhedral cone
- ON ALMOST WELL-POSED MUTUALLY NEAREST AND MUTUALLY FURTHEST POINT PROBLEMS
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
- On nearest points in closed convex sets
- Porosity results for two-set nearest and farthest point problems
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
- Exterior point algorithms for nearest points and convex quadratic programs
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
Uses Software
This page was built for publication: The nearest point problem in a polyhedral set and its extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694540)
