Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- 44 Downloads
The least distance problem is considered for a convex hull of a finite family of vectors in a finite-dimensional Euclidian space. It is reduced to an equivalent nonsmooth optimization problem with a directly estimated penalty parameter for which subgradient algorithms with space dilation are proposed.
Keywordsprojection problem nonsmooth exact penalty functions r-algorithms
Unable to display preview. Download preview PDF.
- 1.E. A. Nurminski, “Projection onto polyhedra in outer representation,” J. Comp. Mat. Math. Phys., 48, Issue 3, 367–375 (2008).Google Scholar
- 3.Y. Censor, M. Jiang, and A. K. Louis (eds.), “Mathematical methods in biomedical imaging and intensity-modulated radiation therapy (IMRT),” in: Publications of the Scuola Normale Superiore Subseries, CRM Series, 7 (2008).Google Scholar
- 5.N. Z. Shor, Minimization Methods for Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kyiv (1979).Google Scholar
- 7.B. N. Pshenichnyi, Linearization Method [in Russian], Nauka, Moscow (1983).Google Scholar
- 8.A. M. Priyatel’, “Solving convex programming problems by the r-algorithm with projection,” in: Analysis of the Methods of Solution of Extremum Problems: A Collection of Scientific Papers [in Russian], V. M. Glushkov Inst. of Cybernetics AS USSR (1986), pp. 24–30.Google Scholar