The modified second APG method for DC optimization problems
From MaRDI portal
Recommendations
- An accelerated proximal algorithm for the difference of convex programming
- On the convergence of an approximate proximal method for DC functions
- scientific article; zbMATH DE number 2076851
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
Cites work
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors
- A proximal difference-of-convex algorithm with extrapolation
- A subgradient-based convex approximations method for DC programming and its applications
- Accelerating the DC algorithm for smooth functions
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC approximation approaches for sparse optimization
- DC formulations and algorithms for sparse optimization problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Error Bounds for Convex Polynomials
- From error bounds to the complexity of first-order descent methods for convex functions
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Introductory lectures on convex optimization. A basic course.
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
- 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
- Proximal splitting methods in signal processing
- Variational Analysis
Cited in
(6)- Accelerating the DC algorithm for smooth functions
- An accelerated proximal algorithm for the difference of convex programming
- On the convergence of an approximate proximal method for DC functions
- A DCA for MPCCs converging to a S-stationary point
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
- Convergence of a proximal-type method for DC functions
This page was built for publication: The modified second APG method for DC optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311112)
