A proximal difference-of-convex algorithm with extrapolation
From MaRDI portal
Abstract: We consider a class of difference-of-convex (DC) optimization problems whose objective is level-bounded and is the sum of a smooth convex function with Lipschitz gradient, a proper closed convex function and a continuous concave function. While this kind of problems can be solved by the classical difference-of-convex algorithm (DCA) [26], the difficulty of the subproblems of this algorithm depends heavily on the choice of DC decomposition. Simpler subproblems can be obtained by using a specific DC decomposition described in [27]. This decomposition has been proposed in numerous work such as [18], and we refer to the resulting DCA as the proximal DCA. Although the subproblems are simpler, the proximal DCA is the same as the proximal gradient algorithm when the concave part of the objective is void, and hence is potentially slow in practice. In this paper, motivated by the extrapolation techniques for accelerating the proximal gradient algorithm in the convex settings, we consider a proximal difference-of-convex algorithm with extrapolation to possibly accelerate the proximal DCA. We show that any cluster point of the sequence generated by our algorithm is a stationary point of the DC optimization problem for a fairly general choice of extrapolation parameters: in particular, the parameters can be chosen as in FISTA with fixed restart [15]. In addition, by assuming the Kurdyka-{L}ojasiewicz property of the objective and the differentiability of the concave part, we establish global convergence of the sequence generated by our algorithm and analyze its convergence rate. Our numerical experiments on two difference-of-convex regularized least squares models show that our algorithm usually outperforms the proximal DCA and the general iterative shrinkage and thresholding algorithm proposed in [17].
Recommendations
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- Applications of the proximal difference-of-convex algorithm with extrapolation in optimal correction
- An accelerated proximal algorithm for the difference of convex programming
- An extension of the proximal point algorithm beyond convexity
- scientific article; zbMATH DE number 6719195
- Proximal extrapolated gradient methods for variational inequalities
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Global convergence of a proximal linearized algorithm for difference of convex functions
- A proximal point algorithm revisited and extended
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A general double-proximal gradient algorithm for d.c. programming
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- Adaptive restart for accelerated gradient schemes
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC formulations and algorithms for sparse optimization problems
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact penalty and error bounds in DC programming
- Exact penalty in d. c. programming
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- 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
- Nearly unbiased variable selection under minimax concave penalty
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Penalty methods for a class of non-Lipschitz optimization problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal splitting methods in signal processing
- Some methods of speeding up the convergence of iteration methods
- Sparse Reconstruction by Separable Approximation
- Templates for convex cone problems with applications to sparse signal recovery
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
Cited in
(only showing first 100 items - show all)- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems
- On DC based methods for phase retrieval
- A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
- The proximal methods for solving absolute value equation
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
- The proximity operator of the log-sum penalty
- A unified Douglas-Rachford algorithm for generalized DC programming
- Alternating DC algorithm for partial DC programming problems
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
- Sparse signal recovery via generalized Gaussian function
- Kurdyka-Łojasiewicz exponent via inf-projection
- A modified proximal point method for DC functions on Hadamard manifolds
- Relating _p regularization and reweighted _1 regularization
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
- A general inertial projected gradient method for variational inequality problems
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- The modified second APG method for DC optimization problems
- A general double-proximal gradient algorithm for d.c. programming
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- A global exact penalty for rank-constrained optimization problem and applications
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
- scientific article; zbMATH DE number 6719195 (Why is no real title available?)
- Composite difference-MAX programs for modern statistical estimation problems
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- A three-operator splitting algorithm for nonconvex sparsity regularization
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- First-order algorithms for a class of fractional optimization problems
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Learning Markov models via low-rank optimization
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Learnable descent algorithm for nonsmooth nonconvex image reconstruction
- Penalty and augmented Lagrangian methods for constrained DC programming
- The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property
- New Bregman proximal type algoritms for solving DC optimization problems
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Applications of the proximal difference-of-convex algorithm with extrapolation in optimal correction
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Regularized linear discriminant analysis via a new difference-of-convex algorithm with extrapolation
- Inexact proximal DC Newton-type method for nonconvex composite functions
- 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
- Calculus rules of the generalized concave Kurdyka-Łojasiewicz property
- A three-operator splitting algorithm with deviations for generalized DC programming
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- Open issues and recent advances in DC programming and DCA
- An accelerated proximal algorithm for the difference of convex programming
- A proximal alternating direction method of multipliers for DC programming with structured constraints
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
- An inertial projection and contraction algorithm for pseudomonotone variational inequalities without Lipschitz continuity
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application
- 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
- Global convergence and acceleration of projection methods for feasibility problems involving union convex sets
- Alternating linearized proximal algorithm for the low Tucker rank tensor completion problem
- Tensor completion by L_-L_F bilevel programming
- Optimization on the quaternion Stiefel manifold with applications. II: L1-QPCA
- Equivalence of the Polyak-Łojasiewicz-Kurdyka exponent via difference-of-Moreau-envelope smoothing
- The boosted double-proximal subgradient algorithm for nonconvex optimization
- Algorithms for structured sparsity promoting functions regularized image restoration model
- Efficient algorithms for mixed noise removal via nonlocal low-rank regularization
- Three operator splitting algorithms for solving nonsmooth DC programming problems
- General inertial proximal DC algorithm for three block nonsmooth DC optimization problems
- Low rank tensor completion algorithms based on non-convex L_*-L_F optimization
- 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
- A proximal splitting algorithm for generalized DC programming with applications in signal recovery
- Smoothing randomized block-coordinate proximal gradient algorithms for nonsmooth nonconvex composite optimization
- Doubly relaxed forward-Douglas-Rachford splitting for the sum of two nonconvex and a DC function
- An inexact Bregman proximal difference-of-convex algorithm with two types of relative stopping criteria
- An extended sequential quadratic method with extrapolation
- An accelerated double-proximal gradient algorithm for DC programming
- The modified second APG method for a class of nonconvex nonsmooth problems
- On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions
- Contractive difference-of-convex algorithms
- An inexact proximal linearized DC algorithm with provably terminating inner loop
- New Douglas-Rashford splitting algorithms for generalized DC programming with applications in machine learning
- An inertial Bregman proximal DC algorithm for generalized DC programming with application to data completion
- Efficient active manifold identification via accelerated iteratively reweighted nuclear norm minimization
- A Bregman ADMM for robust fused Lasso estimation with doubly nonconvex regularizers
- An extragradient method for generalized DC programming
- A preconditioned difference of convex functions algorithm with extrapolation and line search
- Two-step inertial proximal difference-of-convex algorithm
- Avoiding strict saddle points of nonconvex regularized problems
- A proximal difference of convex functions algorithm using Barzilai-Borwein step size with nonmonotone line search and extrapolation
This page was built for publication: A proximal difference-of-convex algorithm with extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744881)
