Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
From MaRDI portal
Publication:2570899
DOI10.1155/S1110757X04309071zbMath1083.90041OpenAlexW2077744171MaRDI QIDQ2570899
Publication date: 31 October 2005
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/52208
Related Items (5)
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems ⋮ On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems
This page was built for publication: Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
