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: | Stefan M. Stefanov |
---|---|
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!
|
Similar Items
-
Convex separable minimization problems with a linear
constraint and bounded variables
by: Stefan M. Stefanov
Published: (2005-01-01) -
CONSTRAINTS OF PROJECT MANAGEMENT IN THE NIGERIAN CONSTRUCTION INDUSTRY
by: LATEEF AKINTOLA, et al.
Published: (2024-03-01) -
Linear Discrete Pursuit Game Problem with Total Constraints
by: Atamurat Kuchkarov, et al.
Published: (2013-01-01) -
On Vehicle Stabilization Under Saturation Constraints by Linear Quadratic Regulator
by: Mulia Vania Katherine, et al.
Published: (2022-12-01) -
Feminine fox, not so feminine box: constraints on linguistic relativity effects for grammatical and conceptual gender
by: James Brand, et al.
Published: (2025-01-01)