Pages that link to "Item:Q5242930"
From MaRDI portal
The following pages link to Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930):
Displaying 12 items.
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
- First-Order Algorithms for a Class of Fractional Optimization Problems (Q5026841) (← links)
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm (Q6138297) (← links)
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems (Q6141533) (← links)
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems (Q6157998) (← links)
- A three-operator splitting algorithm with deviations for generalized DC programming (Q6169253) (← links)
- Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization (Q6188511) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)