A proximal difference-of-convex algorithm with extrapolation

DOI10.1007/s10589-017-9954-1zbMath1401.90175arXiv1612.06265OpenAlexW2576873436WikidataQ57511117 ScholiaQ57511117MaRDI QIDQ1744881

Bo Wen, Xiaojun Chen, Ting Kei Pong

Publication date: 20 April 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.06265

zbMATH Keywords

extrapolationnonconvexnonsmoothKurdyka-Łojasiewicz inequalitydifference-of-convex problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (56)

Alternating DC algorithm for partial DC programming problems ⋮ An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems ⋮ Convergence guarantees for a class of non-convex and non-smooth 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 ⋮ Composite Difference-Max Programs for Modern Statistical Estimation Problems ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ New Bregman proximal type algoritms for solving DC optimization problems ⋮ An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis ⋮ A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection ⋮ Iteratively reweighted \(\ell _1\) algorithms with extrapolation ⋮ Learning Markov Models Via Low-Rank Optimization ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization ⋮ 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 ⋮ A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula ⋮ 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 ⋮ Unnamed Item ⋮ Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization ⋮ On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression ⋮ A general inertial projected gradient method for variational inequality problems ⋮ 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 proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ 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 ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing ⋮ The proximal methods for solving absolute value equation ⋮ The modified second APG method for DC optimization problems ⋮ Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems ⋮ 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 ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ The proximity operator of the log-sum penalty ⋮ Penalty and Augmented Lagrangian Methods for Constrained DC Programming ⋮ The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property ⋮ First-Order Algorithms for a Class of Fractional Optimization Problems ⋮ A unified Douglas-Rachford algorithm for generalized DC programming

Uses Software

• UNLocBoX
• TFOCS

Cites Work

• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Gradient methods for minimizing composite functions
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Exact penalty and error bounds in DC programming
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Dual extrapolation and its applications to solving variational inequalities and related problems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Introductory lectures on convex optimization. A basic course.
• Exact penalty in d. c. programming
• DC formulations and algorithms for sparse optimization problems
• Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
• 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
• 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
• A general double-proximal gradient algorithm for d.c. programming
• Adaptive restart for accelerated gradient schemes
• Further properties of the forward-backward envelope with applications to difference-of-convex programming
• Proximal Splitting Methods in Signal Processing
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Variational Analysis
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Sparse Reconstruction by Separable Approximation
• Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
• A New Decomposition Method for Multiuser DC-Programming and Its Applications
• Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Some methods of speeding up the convergence of iteration methods
• Penalty Methods for a Class of Non-Lipschitz Optimization Problems
• Convex analysis and global optimization

This page was built for publication: A proximal difference-of-convex algorithm with extrapolation