Back to Search
Start Over
DC semidefinite programming and cone constrained DC optimization II: local search methods.
- Source :
- Computational Optimization & Applications; Jul2023, Vol. 85 Issue 3, p993-1031, 39p
- Publication Year :
- 2023
-
Abstract
- The second part of our study is devoted to a detailed convergence analysis of two extensions of the well-known DCA method for solving DC (Difference of Convex functions) optimization problems to the case of general cone constrained DC optimization problems. We study the global convergence of the DCA for cone constrained problems and present a comprehensive analysis of a version of the DCA utilizing exact penalty functions. In particular, we study the exactness property of the penalized convex subproblems and provide two types of sufficient conditions for the convergence of the exact penalty method to a feasible and critical point of a cone constrained DC optimization problem from an infeasible starting point. In the numerical section of this work, the exact penalty DCA is applied to the problem of computing compressed modes for variational problems and the sphere packing problem on Grassmannian. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09266003
- Volume :
- 85
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Computational Optimization & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 164706780
- Full Text :
- https://doi.org/10.1007/s10589-023-00479-y