Finding the projection onto the intersection of a closed half-space and a variable box
From MaRDI portal
Publication:2450616
DOI10.1016/j.orl.2013.01.014zbMath1286.90105OpenAlexW2009211233MaRDI QIDQ2450616
Juhe Sun, Shi-Yun Wang, Yong-Jin Liu
Publication date: 14 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.01.014
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)
Related Items (5)
Properties associated with the epigraph of the \(l_1\) norm function of projection onto the nonnegative orthant ⋮ Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian ⋮ The geometric properties of a class of nonsymmetric cones ⋮ Fast algorithm for singly linearly constrained quadratic programs with box-like constraints ⋮ Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm
Cites Work
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- Structured low rank approximation
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Fastest Mixing Markov Chain on Graphs with Symmetries
- Quasi-Newton Updates with Bounds
- A polynomially bounded algorithm for a singly constrained quadratic program
- Fastest Mixing Markov Chain on a Graph
This page was built for publication: Finding the projection onto the intersection of a closed half-space and a variable box
