An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in R n
- 16 October 2018
- journal article
- research article
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 7 (2) , 177-207
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Breakpoint searching algorithms for the continuous quadratic knapsack problemMathematical Programming, 2006
- An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in RnJournal of Optimization Theory and Applications, 2003
- Lectures on Modern Convex Optimization2001
- Newton's Method for Large Bound-Constrained Optimization ProblemsSIAM Journal on Optimization, 1999
- A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$RAIRO - Operations Research, 1997
- A Limited Memory Algorithm for Bound Constrained OptimizationSIAM Journal on Scientific Computing, 1995
- An algorithm for a singly constrained class of quadratic programs subject to upper and lower boundsMathematical Programming, 1990
- A linear-time median-finding algorithm for projecting a vector on the simplex of nOperations Research Letters, 1989
- A finite algorithm for finding the projection of a point onto the canonical simplex of ? nJournal of Optimization Theory and Applications, 1986
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984