Fast projection method for a special class of polytopes with applications

DOI10.1051/RO/1988220403471zbMATH Open0663.90098OpenAlexW1186765011MaRDI QIDQ3815151FDOQ3815151

Authors: Paolo D'Alessandro, Manuela Dalla Mora 

Publication date: 1988

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104948

Recommendations

• Two fast algorithms for projecting a point onto the canonical simplex
• Finding the projection on a polytope: An iterative method
• Fast projection onto the simplex and the \(l_1\) ball
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
• scientific article; zbMATH DE number 3924512

zbMATH Keywords

projectionssmoothingconvex analysispolytope

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Mathematical programming (90C99)

Cited In (3)

• Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
• A big-M type method for the computation of projections onto polyhedrons
• Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)

This page was built for publication: Fast projection method for a special class of polytopes with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815151)