An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
type: Item
instance of: scholarly article
title: An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
zbMATH Open document ID: 1115.90397
DOI: 10.1023/A:1023997605430
author: E. M. Macambira
author: Nelson Maculan
author: Cláudio P. Santiago
author: Maria Helena C. Jardim
published in: Journal of Optimization Theory and Applications
publication date: 2003-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1997772
zbMATH Keywords: Orthogonal projections
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: computational linear algebra
zbMATH Keywords: subgradient methods
MaRDI profile type: Publication
cites work: A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
cites work: Validation of subgradient optimization
cites work: Network synthesis problems
cites work: A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
cites work: An O(n) algorithm for quadratic knapsack problems
cites work: A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
cites work: An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
cites work: Q3619797
cites work: Q3738922
cites work: An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
full work available at URL: a:1023997605430
OpenAlex ID: W18706009
description: scientific article; zbMATH DE number 1997772