Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
From MaRDI portal
(Redirected from Publication:6188511)
Recommendations
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Computing B-stationary points of nonsmooth DC programs
- Proximal bundle methods for nonsmooth DC programming
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
Cites work
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Composite difference-MAX programs for modern statistical estimation problems
- Computing B-stationary points of nonsmooth DC programs
- Convex Analysis
- DC formulations and algorithms for sparse optimization problems
- DC programming and DCA for general DC programs
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
- Penalty and augmented Lagrangian methods for constrained DC programming
- Sparse Reconstruction by Separable Approximation
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Two-Point Step Size Gradient Methods
- Variational Analysis
This page was built for publication: Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188511)
