A proximal difference-of-convex algorithm with extrapolation

From MaRDI portal
Publication:1744881


DOI10.1007/s10589-017-9954-1zbMath1401.90175arXiv1612.06265WikidataQ57511117 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


65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming


Related Items

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_0$ Regularized Optimization Problems, Learning Markov Models Via Low-Rank Optimization, Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming, Convergence guarantees for a class of non-convex and non-smooth optimization problems, 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, Unnamed Item, New Bregman proximal type algoritms for solving DC optimization problems, An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, 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, 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, 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 \(\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 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 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, 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


Uses Software


Cites Work