DC formulations and algorithms for sparse optimization problems
From MaRDI portal
Recommendations
- DC approximation approaches for sparse optimization
- scientific article; zbMATH DE number 757676
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Sparse optimization theory and methods
- On solutions of sparsity constrained optimization
- Algorithms for sparsity-constrained optimization
- Sparse solutions of a class of constrained optimization problems
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Optimization algorithms for sparse representations and applications
- On d.c. optimization problems
Cites work
- scientific article; zbMATH DE number 3876377 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- A DC programming approach for sparse linear discriminant analysis
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A proof of convergence of the concave-convex procedure using Zangwill's theory
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Best subset selection via a modern optimization lens
- CVaR norm and applications in optimization
- Compressed sensing
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- DC approximation approaches for sparse optimization
- De-noising by soft-thresholding
- Decoding by Linear Programming
- Exact matrix completion via convex optimization
- Exact penalty and error bounds in DC programming
- Exact penalty in d. c. programming
- Fixed point and Bregman iterative methods for matrix rank minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Gradient methods for minimizing composite functions
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Linear best approximation using a class of polyhedral norms
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- Nearly unbiased variable selection under minimax concave penalty
- On matrix approximation problems with Ky Fan \(k\) norms
- On the Moreau-Yosida regularization of the vector \(k\)-norm related functions
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Properties of two DC algorithms in quadratic programming
- Robust investment strategies with discrete asset choice constraints using DC programming
- Robust linear optimization under general norms.
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Sparse Approximate Solutions to Linear Systems
- Sparse and stable Markowitz portfolios
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Time bounds for selection
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(64)- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- A Lagrange–Newton algorithm for tensor sparse principal component analysis
- Joint sparse optimization: lower-order regularization method and application in cell fate conversion
- Cardinality minimization, constraints, and regularization: a survey
- Dual formulation of the sparsity constrained optimization problem: application to classification
- Penalty method for the sparse portfolio optimization problem
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- A proximal alternating direction method of multipliers for DC programming with structured constraints
- Difference of Convex programming in adversarial SVM
- 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
- Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization
- Level constrained first order methods for function constrained optimization
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- The proximal methods for solving absolute value equation
- Data clustering based on the modified relaxation Cheeger cut model
- The use of grossone in elastic net regularization and sparse support vector machines
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- A three-operator splitting algorithm with deviations for generalized DC programming
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Deforming \(\|.\|_1\) into \(\|.\|_{\infty}\) via polyhedral norms: a pedestrian approach
- A three-operator splitting algorithm for nonconvex sparsity regularization
- Sum-of-squares relaxations in robust DC optimization and feature selection
- Orthant-strictly monotonic norms, generalized top-\(k\) and \(k\)-support norms and the \(\ell_0\) pseudonorm
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- Feature selection in SVM via polyhedral \(k\)-norm
- Alternating DC algorithm for partial DC programming problems
- Polytopal balls arising in optimization
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
- Applications of the proximal difference-of-convex algorithm with extrapolation in optimal correction
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- First-order algorithms for a class of fractional optimization problems
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- 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
- A proximal difference-of-convex algorithm with extrapolation
- Generalized Subdifferentials of Spectral Functions over Euclidean Jordan Algebras
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- On the pervasiveness of difference-convexity in optimization and statistics
- Inexact proximal DC Newton-type method for nonconvex composite functions
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- The modified second APG method for DC optimization problems
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures
- An \(\ell_{2,0}\)-norm constrained matrix optimization via extended discrete first-order algorithms
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- A solution approach for cardinality minimization problem based on fractional programming
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- A Lagrange-Newton algorithm for sparse nonlinear programming
This page was built for publication: DC formulations and algorithms for sparse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749449)
