Accelerating the DC algorithm for smooth functions

Mathematical Programming

Volumn 169, Issue 1, 2018, Pages 95-118

  Aragón Artacho, Francisco J ^a   Fleming, Ronan M T ^b   Vuong, Phan T ^b  

^a UNIVERSITY OF ALICANTE   (Spain)

^b UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

Biochemical reaction networks; DC algorithm; DC function; DC programming; ojasiewicz property

Indexed keywords

MATHEMATICAL PROGRAMMING; SOFTWARE ENGINEERING;

BIOCHEMICAL REACTION NETWORK; D-C PROGRAMMING; DC ALGORITHM; DC FUNCTIONS; GLOBALLY CONVERGENT; NON-EQUILIBRIUM STEADY STATE; NUMBER OF ITERATIONS; NUMERICAL EXPERIMENTS;

BIOCHEMISTRY;

EID: 85024478699     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-017-1180-1     Document Type: Article

References (25)

1. Absil, P.A., Mahony, R., Andrews, B.: Convergence of the iterates of descent methods for analytic cost functions. SIAM J. Optim. 16(2), 531–547 (2005)
2. Artacho Aragón, F.J., Fleming, R.M.T.: Globally convergent algorithms for finding zeros of duplomonotone mappings. Optim. Lett. 9(3), 569–584 (2015)
3. Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1–2), 5–16 (2009)
4. Bolte, J., Daniilidis, A., Lewis, A.: The Łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205–1223 (2007)
5. Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1–2), 459–494 (2013)
6. Collobert, R., Sinz, F., Weston, J., Bottou, L.: Trading convexity for scalability. In: Proceedings of the 23rd International Conference on Machine Learning, pp. 201–208. ACM (2006)
7. Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12(8), 989–1000 (1981)
8. Gevorgyan, A., Poolman, M.G., Fell, D.A.: Detection of stoichiometric inconsistencies in biomolecular models. Bioinformatics 24(19), 2245–2251 (2008)
9. Huang, Y., Liu, H., Zhou, S.: A Barzilai–Borwein type method for stochastic linear complementarity problems. Numer. Algorithms 67(3), 477–489 (2014)
10. Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1–4), 23–46 (2005)
11. Le Thi, H.A., Pham Dinh, T.: On solving linear complementarity problems by DC programming and DCA. Comput. Optim. Appl. 50(3), 507–524 (2011)
12. Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Numerical solution for optimization over the efficient set by D.C. optimization algorithms. Oper. Res. Lett. 19(3), 117–128 (1996)
13. Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: Convergence analysis of DC algorithm for DC programming with subanalytic data. Ann. Oper. Res. Technical Report, LMI, INSA-Rouen (2009)
14. Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420–1443 (2014)
15. Li, G., Pong, T.K.: Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Progr. 159(1), 371–401 (2016)
16. Łojasiewicz, S.: Ensembles semi-analytiques. Institut des Hautes Etudes Scientifiques, Bures-sur-Yvette (Seine-et-Oise), France (1965)
17. Mine, H., Fukushima, M.: A minimization method for the sum of a convex function and a continuously differentiable function. J. Optim. Theory Appl. 33(1), 9–23 (1981)
18. Moudafi, A., Mainge, P.: On the convergence of an approximate proximal method for DC functions. J. Comput. Math. 24(4), 475–480 (2006)
19. Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125–161 (2013)
20. Nocedal, J., Wright, S.J.: Numerical optimization. In: Mikosch, T.V., Resnick, S.I., Robinson, S.M. (eds.) Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)
21. Parks, H.R., Krantz, S.G.: A Primer of Real Analytic Functions. Birkhäuser, Basel (1992)
22. Pham Dinh, T., Le Thi, H.A.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476–505 (1998)
23. Pham Dinh, T., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients. In: Hiriart-Urruty, J.-B. (ed.) FERMAT Days 85: Mathematics for Optimization, Volume 129 of North-Holland Mathematics Studies, pp. 249–271. Elsevier, Amsterdam (1986)
24. Schnörr, C., Schüle, T., Weber, S.: Variational reconstruction with DC-programming. In: Herman, G.T., Kuba, A. (eds.) Advances in Discrete Tomography and its Applications, pp. 227–243. Springer, Berlin (2007)
25. Thiele, I., et al.: A community-driven global reconstruction of human metabolism. Nat. Biotechnol. 31(5), 419–425 (2013)