Pages that link to "Item:Q1744881"
From MaRDI portal
The following pages link to A proximal difference-of-convex algorithm with extrapolation (Q1744881):
Displaying 50 items.
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems (Q2029679) (← links)
- On DC based methods for phase retrieval (Q2050353) (← links)
- A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging (Q2051043) (← links)
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing (Q2059822) (← links)
- The proximal methods for solving absolute value equation (Q2061369) (← links)
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
- The proximity operator of the log-sum penalty (Q2103448) (← links)
- A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
- Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems (Q2149955) (← links)
- Sparse signal recovery via generalized Gaussian function (Q2154451) (← links)
- Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
- A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
- Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization (Q2230788) (← links)
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
- A general inertial projected gradient method for variational inequality problems (Q2244991) (← links)
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- The modified second APG method for DC optimization problems (Q2311112) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
- A global exact penalty for rank-constrained optimization problem and applications (Q2696914) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
- Composite Difference-Max Programs for Modern Statistical Estimation Problems (Q4562249) (← links)
- Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)
- A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization (Q5005209) (← links)
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← 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)
- Learning Markov Models Via Low-Rank Optimization (Q5106374) (← links)
- Convergence guarantees for a class of non-convex and non-smooth optimization problems (Q5214248) (← links)
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
- Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
- Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
- The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property (Q5870355) (← links)
- New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis (Q6043137) (← links)
- (Q6098205) (← 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)
- Regularized linear discriminant analysis via a new difference-of-convex algorithm with extrapolation (Q6142181) (← links)
- Inexact proximal DC Newton-type method for nonconvex composite functions (Q6155059) (← links)
- Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis (Q6158000) (← links)
