Abstract
A gradient projection method with feasible inexact projections is proposed in the present paper. The inexact projection is performed using a general relative error tolerance. Asymptotic convergence analysis under quasiconvexity assumption and iteration-complexity bounds under convexity assumption of the method employing constant and Armijo step sizes are presented. Numerical results are reported illustrating the potential advantages of considering inexact projections instead of exact ones in some medium scale instances of a least squares problem over the spectrohedron.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have