Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in R^n

DOI10.1155/S1110757X04309071MaRDI QIDQ2570899zbMATH OpenOpenAlexFDO

Authors S. M. Stefanov

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

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• 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

Cited in

(7)

• 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)