Abstract
We consider the problem of projecting a point onto a region defined by a linear equality or inequality constraint and two-sided bounds on the variables. Such problems are interesting because they arise in various practical problems and as subproblems of gradient-type methods for constrained optimization. Polynomial algorithms are proposed for solving these problems and their convergence is proved. Some examples and results of numerical experiments are presented.
Citation
Stefan M. Stefanov. "Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in $\mathbb{R}^n$." J. Appl. Math. 2004 (5) 409 - 431, 18 November 2004. https://doi.org/10.1155/S1110757X04309071
Information