Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
From MaRDI portal
Publication:2425177
Recommendations
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- A proximal difference-of-convex algorithm with extrapolation
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- An accelerated proximal algorithm for the difference of convex programming
- New Bregman proximal type algoritms for solving DC optimization problems
Cites work
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- A proximal difference-of-convex algorithm with extrapolation
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Adaptive restart for accelerated gradient schemes
- Computing B-stationary points of nonsmooth DC programs
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- DC formulations and algorithms for sparse optimization problems
- DC programming and DCA for general DC programs
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- On Cones of Nonnegative Quadratic Functions
- Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal splitting methods in signal processing
- Second-order-cone constraints for extended trust-region subproblems
- Variational Analysis
Cited in
(39)- Nonconvex robust programming via value-function optimization
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- A unified Douglas-Rachford algorithm for generalized DC programming
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
- A double extrapolation primal-dual algorithm for saddle point problems
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
- Computing B-stationary points of nonsmooth DC programs
- Composite difference-MAX programs for modern statistical estimation problems
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization
- Penalty and augmented Lagrangian methods for constrained DC programming
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
- A refined inertial DC algorithm for DC programming
- Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
- Open issues and recent advances in DC programming and DCA
- A proximal alternating direction method of multipliers for DC programming with structured constraints
- A generalized formulation for group selection via ADMM
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- Equivalence of the Polyak-Łojasiewicz-Kurdyka exponent via difference-of-Moreau-envelope smoothing
- A multi-step inertial Bregman proximal DC algorithm and its application to solving some inverse problems
- A four-operator splitting algorithm for nonconvex and nonsmooth optimization
- An inexact Bregman proximal difference-of-convex algorithm with two types of relative stopping criteria
- Contractive difference-of-convex algorithms
- An inexact proximal linearized DC algorithm with provably terminating inner loop
- An inertial Bregman proximal DC algorithm for generalized DC programming with application to data completion
- A proximal difference of convex functions algorithm using Barzilai-Borwein step size with nonmonotone line search and extrapolation
- Inexact proximal linearized algorithm for difference of convex composite functions
- Exact penalization at d-stationary points of cardinality- or rank-constrained problem
- Inertial proximal difference-of-convex algorithm with convergent Bregman plug-and-play for nonconvex imaging
This page was built for publication: Enhanced proximal DC algorithms with extrapolation for 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 Q2425177)
