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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Set-valued and variational analysis Ročník 30; číslo 4; s. 1265 - 1289
Hlavní autori:	Aragón-Artacho, F. J., Campoy, R., Vuong, P. T.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Netherlands 01.12.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!