The Boosted DC Algorithm for Linearly Constrained DC Programming

The Boosted Difference of Convex functions Algorithm (BDCA) has been recently introduced to accelerate the performance of the classical Difference of Convex functions Algorithm (DCA). This acceleration is achieved thanks to an extrapolation step from the point computed by DCA via a line search proce...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Set-valued and variational analysis Jg. 30; H. 4; S. 1265 - 1289
Hauptverfasser:	Aragón-Artacho, F. J., Campoy, R., Vuong, P. T.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Dordrecht Springer Netherlands 01.12.2022 Springer Nature B.V
Schlagworte:	Algorithms Analysis Constraints Convex analysis Mathematics Mathematics and Statistics Optimization Boosted difference of convex functions algorithm 90C20 Global convergence Trust region subproblem 65K05 Copositivity problem Difference of convex functions 65K10 90C26 47N10 Constrained DC program
ISSN:	1877-0533, 1877-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!