Alternating DC algorithm for partial DC programming problems
From MaRDI portal
Publication:2124808
DOI10.1007/s10898-021-01043-wzbMath1490.90225OpenAlexW3171587104MaRDI QIDQ2124808
Hoai An Le Thi, Vinh Thanh Ho, Tao Pham Dinh, van Ngai Huynh
Publication date: 11 April 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01043-w
Related Items
Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation, A refined inertial DC algorithm for DC programming, Open issues and recent advances in DC programming and DCA, Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Semianalytic and subanalytic sets
- On gradients of functions definable in o-minimal structures
- On semi- and subanalytic geometry
- Geometry of subanalytic and semialgebraic sets
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- A proximal difference-of-convex algorithm with extrapolation
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- On the variational principle
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Sequential difference-of-convex programming
- DCA-based algorithms for DC fitting
- Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Computing B-Stationary Points of Nonsmooth DC Programs
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Clarke Subgradients of Stratifiable Functions
- Optimization and nonsmooth analysis
- Variational Analysis
- On Projection Algorithms for Solving Convex Feasibility Problems
- Online Learning Based on Online DCA and Application to Online Classification
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
- An alternating minimization method for robust principal component analysis
- Efficient Nonnegative Matrix Factorization by DC Programming and DCA
- Sparse Approximation via Penalty Decomposition Methods
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Low-rank matrix completion using alternating minimization
- Convex Analysis
- Sur le problème de la division
