Difference of Convex functions (DC) Programming and DC Algorithm (DCA) constitute the backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the State of the Art with recent advances of DC Programming and DCA to meet the growing need for nonconvex optimization and global optimization, both in terms of mathematical …
8/1/2013 · Difference of Convex functions DC Programming and DC Algorithm DCA constitute the backbone of Nonconve x Programming and Global Optimization. The paper is devoted to the State of the Art with recent advances of DC Programming and DCA to meet the growing need for nonconvex optimization and global optimization, both in terms of mathematical modeling as in terms of efficient.
The year 2015 marks the 30th birthday of DC ( Difference of Convex functions) programming and DCA ( DC Algorithms) which constitute the backbone of nonconvex programming and global optimization.
The unified approach based on DC programming and DCA is proposed to solve three classes of optimization problems. The optimization problem in chapter 2 is recast as two general DC programs.
Recent Advances in DC Programming and DCA . By Tao Pham Dinh and Hoai An Le Thi. Abstract. International audienc Topics: [INFO]Computer Science [cs] Publisher: HAL CCSD. Year: 2014. OAI identifier: oai:HAL:hal-01664024v1 Provided by: HAL – Normandie …
DCA – Website of Le Thi Hoai An – univ-lorraine.fr, DCA – Website of Le Thi Hoai An – univ-lorraine.fr, DCA – Website of Le Thi Hoai An – univ-lorraine.fr, DCA – Website of Le Thi Hoai An – univ-lorraine.fr, Recent Advances in DC programming and DCA: Theory, Algorithms and Applications 6th World Congress on Global Optimization (WCGO 2019) July 8 – 10, 2019, Metz, France https://wcgo2019.event.univ-lorraine.fr/ Organizers: Prof. Le Thi Hoai An and Dr. Le Hoai Minh (University of Lorraine, France) General description of the special session, 1/24/2018 · 2013: DCA for general DC programs and recent advances Hitherto DCA is investigated for standard DC programs (minimizing a DC function over a convex set). However, numerous real-world problems deal with DC constraints. In , we present a natural extension of DC programming and DCA for modeling and solving general DC programs with DC constraints. Two resulting approaches consist in reformulating those programs as standard DC programs in order to use standard DCAs .
12/16/2007 · Based on local optimality conditions and duality in DC programming , the DCA consists in the construction of two sequences {x k} and {y k}, candidates to be optimal solutions of primal and dual programs respectively, such that the sequences {g(x k) ? h(x k)} and {h ? (y k) ? g ? (y k)} are decreasing, and {x k} (resp. {y k}) converges to a primal feasible solution x ˜ (resp. a dual feasible solution y ˜).
Pham Dinh, T.
Le Thi, H.A.: Recent advances in DC programming and DCA. In: Transactions on Computational Intelligence XIII. LNCS, vol. 8342, pp. 1—37. Springer, Berlin Heidelberg (2014) Google Scholar Digital Library Pham Dinh, T.
Le Thi, H.A.
Akoa, F.: Combining DCA and interior point techniques for large-scale nonconvex quadratic programming.
Le Thi Hoai An, Huynh Van Ngai and Pham Dinh Tao, DC Programming and DCA for General DC Programs . Advances in Intelligent Systems and Computing ISBN 978-3-319-06568-7, pp. 15-35, Springer 2014. Pham Dinh Tao and Le Thi Hoai An, Recent advances in DC programming and DCA .
