S. Gratton, Ph. L. Toint. Iteration complexity of the difference-of-convex algorithm for unconstrained optimization: a simple proof. // Optimization Letters. – 2026. – DOI: 10.1007/s11590-026-02327-4. – URL: https://doi.org/10.1007/s11590-026-02327-4
S. Gratton & Ph. L. Toint (2026). Iteration complexity of the difference-of-convex algorithm for unconstrained optimization: a simple proof. Optimization Letters. https://doi.org/10.1007/s11590-026-02327-4
S. Gratton and Ph. L. Toint. “Iteration complexity of the difference-of-convex algorithm for unconstrained optimization: a simple proof.” Optimization Letters, 2026. doi:10.1007/s11590-026-02327-4.
@article{Gratton2026,
title = {Iteration complexity of the difference-of-convex algorithm for unconstrained optimization: a simple proof},
author = {Gratton, S. and Toint, Ph. L.},
journal = {Optimization Letters},
year = {2026},
doi = {10.1007/s11590-026-02327-4},
url = {https://doi.org/10.1007/s11590-026-02327-4}
}