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

Full description

Saved in:

Bibliographic Details
Published in:	Set-valued and variational analysis Vol. 30; no. 4; pp. 1265 - 1289
Main Authors:	Aragón-Artacho, F. J., Campoy, R., Vuong, P. T.
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.12.2022 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!