Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in ℝn
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 optimiza...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2004-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/S1110757X04309071 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558095253897216 |
|---|---|
| author | Stefan M. Stefanov |
| author_facet | Stefan M. Stefanov |
| author_sort | Stefan M. Stefanov |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-4bb1e566ab84409896cbc1d890d51dab |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2004-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-4bb1e566ab84409896cbc1d890d51dab2025-02-03T01:33:12ZengWileyJournal of Applied Mathematics1110-757X1687-00422004-01-012004540943110.1155/S1110757X04309071Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in ℝnStefan M. Stefanov0Department of Mathematics, South-West University “Neofit Rilski,”, Blagoevgrad 2700, BulgariaWe 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.http://dx.doi.org/10.1155/S1110757X04309071 |
| spellingShingle | Stefan M. Stefanov Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in ℝn Journal of Applied Mathematics |
| title | Polynomial algorithms for projecting a point onto a region defined by a linear
constraint and box constraints in ℝn |
| title_full | Polynomial algorithms for projecting a point onto a region defined by a linear
constraint and box constraints in ℝn |
| title_fullStr | Polynomial algorithms for projecting a point onto a region defined by a linear
constraint and box constraints in ℝn |
| title_full_unstemmed | Polynomial algorithms for projecting a point onto a region defined by a linear
constraint and box constraints in ℝn |
| title_short | Polynomial algorithms for projecting a point onto a region defined by a linear
constraint and box constraints in ℝn |
| title_sort | polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in rn |
| url | http://dx.doi.org/10.1155/S1110757X04309071 |
| work_keys_str_mv | AT stefanmstefanov polynomialalgorithmsforprojectingapointontoaregiondefinedbyalinearconstraintandboxconstraintsinrn |