Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints

The paper resolves the problem concerning the rate of convergence of the working set based MPRGP (modified proportioning with reduced gradient projection) algorithm with a long steplength of the reduced projected gradient step. The main results of this paper are the formula for the R-linear rate of...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational optimization and applications Jg. 48; H. 1; S. 23 - 44
Hauptverfasser:	Dostal, Zdenk, Domoradova, Marta, Sadowska, Marie
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.01.2011 Springer Nature B.V
Schlagworte:	Algorithms Convergence Convex and Discrete Geometry Experiments Inequalities Management Science Mathematical analysis Mathematical models Mathematical programming Mathematics Mathematics and Statistics Methods Operations Research Operations Research/Decision Theory Optimization Projection Quadratic programming Spectra Statistics Studies Bound constraints Inexact active set strategy Quadratic programming Rate of convergence Finite termination
ISSN:	0926-6003, 1573-2894
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!