DC formulations and algorithms for sparse optimization problems
From MaRDI portal
Publication:1749449
DOI10.1007/s10107-017-1181-0OpenAlexW2738241071MaRDI QIDQ1749449
Akiko Takeda, Katsuya Tono, Jun-Ya Gotoh
Publication date: 16 May 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1181-0
DCAsparse optimizationrank constraintcardinality constraintKy Fan \(k\) normlargest-\(k\) normproximal operation
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Norms (inequalities, more than one norm, etc.) of linear operators (47A30)
Related Items (49)
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ 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 ⋮ The use of grossone in elastic net regularization and sparse support vector machines ⋮ The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ A solution approach for cardinality minimization problem based on fractional programming ⋮ A proximal algorithm with backtracked extrapolation for a class of structured fractional programming ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach ⋮ Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity ⋮ Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection ⋮ Polytopal balls arising in optimization ⋮ A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems ⋮ 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 ⋮ Sum-of-squares relaxations in robust DC optimization and feature selection ⋮ Inexact proximal DC Newton-type method for nonconvex composite functions ⋮ 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/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ An \(\ell_{2,0}\)-norm constrained matrix optimization via extended discrete first-order algorithms ⋮ Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression ⋮ Generalized Subdifferentials of Spectral Functions over Euclidean Jordan Algebras ⋮ On the pervasiveness of difference-convexity in optimization and statistics ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty ⋮ Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach ⋮ A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ 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 ⋮ 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 ⋮ A Lagrange-Newton algorithm for sparse nonlinear programming ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ First-Order Algorithms for a Class of Fractional Optimization Problems ⋮ Data clustering based on the modified relaxation Cheeger cut model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Best subset selection via a modern optimization lens
- DC approximation approaches for sparse optimization
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- Gradient methods for minimizing composite functions
- Exact penalty and error bounds in DC programming
- CVaR norm and applications in optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Properties of two DC algorithms in quadratic programming
- Robust linear optimization under general norms.
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Linear best approximation using a class of polyhedral norms
- On matrix approximation problems with Ky Fan \(k\) norms
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Time bounds for selection
- Exact penalty in d. c. programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A DC programming approach for feature selection in support vector machines learning
- Exact matrix completion via convex optimization
- DC Approximation Approach for ℓ0-minimization in Compressed Sensing
- A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory
- A Singular Value Thresholding Algorithm for Matrix Completion
- Sparse and stable Markowitz portfolios
- On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
- A DC Programming Approach for Sparse Linear Discriminant Analysis
- Decoding by Linear Programming
- Robust investment strategies with discrete asset choice constraints using DC programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Sparse Approximate Solutions to Linear Systems
- De-noising by soft-thresholding
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
This page was built for publication: DC formulations and algorithms for sparse optimization problems
