Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity

DOI10.1137/16M1084754zbMath1369.90130OpenAlexW2743133559MaRDI QIDQ5348469

Miju Ahn, Jong-Shi Pang, Jack X. Xin

Publication date: 18 August 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1084754

zbMATH Keywords

optimality sparsity statistical learning directional stationary points difference-of-convex programs

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Statistical aspects of information-theoretic topics (62B10)

Related Items

Exact penalization for cardinality and rank-constrained optimization problems via partial regularization, An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems, A truncated Newton algorithm for nonconvex sparse recovery, On two recent nonconvex penalties for regularization in machine learning, The DTC (difference of tangentially convex functions) programming: optimality conditions, Accelerated inexact composite gradient methods for nonconvex spectral optimization problems, Composite Difference-Max Programs for Modern Statistical Estimation Problems, Kurdyka-Łojasiewicz exponent via inf-projection, A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, Solving constrained nonsmooth group sparse optimization via group Capped-$\ell_1$ relaxation and group smoothing proximal gradient algorithm, The subdifferential of measurable composite max integrands and smoothing approximation, Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix, Structural properties of affine sparsity constraints, Computation of the maximum likelihood estimator in low-rank factor analysis, A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems, Distributed nonconvex constrained optimization over time-varying digraphs, Sparse precision matrix estimation with missing observations, A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems, A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity, Unnamed Item, Nonconvex optimization for robust tensor completion from grossly sparse observations, Unnamed Item, On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression, On the pervasiveness of difference-convexity in optimization and statistics, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, A proximal difference-of-convex algorithm with extrapolation, DC programming and DCA: thirty years of developments, Minimization of transformed $L_1$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing, Iteratively Reweighted Group Lasso Based on Log-Composite Regularization, Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods, Computation of second-order directional stationary points for group sparse optimization, Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods, Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes, Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming, Unnamed Item, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms, Penalty and Augmented Lagrangian Methods for Constrained DC Programming, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming

Uses Software

Cites Work