Alternating DC algorithm for partial DC programming problems
From MaRDI portal
Publication:2124808
DOI10.1007/S10898-021-01043-WzbMATH Open1490.90225OpenAlexW3171587104MaRDI QIDQ2124808FDOQ2124808
Le Thi Hoai An, Vinh Thanh Ho, Pham Dinh Tao, 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
Recommendations
- scientific article; zbMATH DE number 7267266
- A revision of the rectangular algorithm for a class of DC optimization problems
- A DC algorithm for solving quadratic-linear bilevel optimization problems
- A DC Programming Approach for Mixed-Integer Linear Programs
- A unified Douglas-Rachford algorithm for generalized DC programming
- The boosted DC algorithm for linearly constrained DC programming
- DC formulations and algorithms for sparse optimization problems
- Successive search methods for solving a canonical DC programming problem
- On d.c. optimization problems
- On solving linear complementarity problems by DC programming and DCA
Cites Work
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Variational Analysis
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Robust principal component analysis?
- Convex Analysis
- Rank-Sparsity Incoherence for Matrix Decomposition
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Semianalytic and subanalytic sets
- On the variational principle
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- Clarke Subgradients of Stratifiable Functions
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- On semi- and subanalytic geometry
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Sparse Approximation via Penalty Decomposition Methods
- Title not available (Why is that?)
- Sur le problème de la division
- On gradients of functions definable in o-minimal structures
- Geometry of subanalytic and semialgebraic sets
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Low-rank matrix completion using alternating minimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Title not available (Why is that?)
- An alternating minimization method for robust principal component analysis
- Computing B-Stationary Points of Nonsmooth DC Programs
- DC programming and DCA: thirty years of developments
- Sequential difference-of-convex programming
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Efficient Nonnegative Matrix Factorization by DC Programming and DCA
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- A proximal difference-of-convex algorithm with extrapolation
- Online Learning Based on Online DCA and Application to Online Classification
- DCA-based algorithms for DC fitting
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
Cited In (10)
- Title not available (Why is that?)
- A refined inertial DC algorithm for DC programming
- A branch-and-bound algorithm embedded with DCA for DC programming
- Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation
- Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
- Open issues and recent advances in DC programming and DCA
- Title not available (Why is that?)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- A revision of the rectangular algorithm for a class of DC optimization problems
- The boosted DC algorithm for linearly constrained DC programming
Uses Software
This page was built for publication: Alternating DC algorithm for partial DC programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124808)
