Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\) (Q2570899)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\) |
scientific article |
Statements
Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\) (English)
0 references
31 October 2005
0 references
Summary: 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.
0 references
