HIGHLIGHTS
- who: F. J. Aragu00f3n-Artacho from the Department of, University of Alicante, San Vicente del Raspeig, Alicante, Spain have published the article: The Boosted DC Algorithm for Linearly Constrained DC Programming, in the Journal: (JOURNAL)
- what: The authors propose an extension of BDCA that can be applied to difference of convex functions programs with linear constraints and prove that every cluster point of the sequence generated by this algorithm is a Karush-Kuhn-Tucker point of the problem if the feasible set has a Slater point. The authors present some numerical experiments where the authors . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.