arXiv Analytics

Sign in

arXiv:1404.2427 [math.OC]AbstractReferencesReviewsResources

Projection onto simplicial cones by a semi-smooth Newton method

O. P. Ferreira, S. Z. Németh

Published 2014-04-09Version 1

By using Moreau's decomposition theorem for projecting onto cones, the problem of projecting onto a simplicial cone is reduced to finding the unique solution of a nonsmooth system of equations. It is shown that a semi-smooth Newton method applied to the system of equations associated to the problem of projecting onto a simplicial cone is always well defined, and the generated sequence is bounded for any starting point and under a somewhat restrictive assumption it is finite. Besides, under a mild assumption on the simplicial cone, the generated sequence converges linearly to the solution of the associated system of equations.

Related articles: Most relevant | Search more
arXiv:1503.02757 [math.OC] (Published 2015-03-10)
Projection onto simplicial cones by Picard's method
arXiv:1503.02753 [math.OC] (Published 2015-03-10)
A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint
arXiv:0911.2750 [math.OC] (Published 2009-11-14, updated 2010-05-26)
Positive Polynomials and Projections of Spectrahedra