Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope

DOI10.1007/s10559-010-9182-5zbMath1208.90129OpenAlexW2077434773MaRDI QIDQ1956969

Yanyan Li

Publication date: 24 September 2010

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-010-9182-5

zbMATH Keywords

nonsmooth exact penalty functionsr-algorithms

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (3)

The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ Synthesis of cutting and separating planes in a nonsmooth optimization method

Cites Work

• Unnamed Item
• Mathematical methods in biomedical imaging and intensity-modulated radiation therapy (IMRT). Most papers based on the presentations at the interdisciplinary workshop, Pisa, Italy, October 15--19, 2007
• On Projection Algorithms for Solving Convex Feasibility Problems

This page was built for publication: Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope