An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
From MaRDI portal
Publication:1411525
DOI10.1023/A:1023997605430zbMath1115.90397OpenAlexW18706009MaRDI QIDQ1411525
E. M. Macambira, Nelson F. Maculan, Cláudio P. Santiago, Maria Helena C. Jardim
Publication date: 29 October 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023997605430
Related Items
An accelerated coordinate gradient descent algorithm for non-separable composite optimization, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Optimal iterative QP and QPQC algorithms, DC programming and DCA for enhancing physical layer security via cooperative jamming, A Newton's method for the continuous quadratic knapsack problem, An efficient DCA based algorithm for power control in large scale wireless networks, A Distributed Boyle--Dykstra--Han Scheme, The geometric properties of a class of nonsymmetric cones, Variable fixing algorithms for the continuous quadratic Knapsack problem, Finding the projection onto the intersection of a closed half-space and a variable box, A constrained optimum experimental design problem for model discrimination with a continuously varying factor, A survey on the continuous nonlinear resource allocation problem, On linear-time algorithms for the continuous quadratic Knapsack problem, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets, Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion, Configuring A Sensor Network for Fault Detection in Distributed Parameter Systems, A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem, A Decomposition Algorithm for Nested Resource Allocation Problems, Faster subgradient methods for functions with Hölderian growth, Variable fixing method by weighted average for the continuous quadratic knapsack problem, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Network synthesis problems
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
- Validation of subgradient optimization
