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!
|