Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in R^n
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.
- Solution of projection problems over polytopes
- Two fast algorithms for projecting a point onto the canonical simplex
- Fast projection method for a special class of polytopes with applications
- Projected gradient methods for linearly constrained problems
- Finding the projection on a polytope: An iterative method
- Solution of projection problems over polytopes
- On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
- Well-posedness and primal-dual analysis of some convex separable optimization problems
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- A survey on the continuous nonlinear resource allocation problem
- A point positioning algorithm to determine whether convex regions bounded by multiple linear constraints are empty.
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
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\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570899)
