Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
From MaRDI portal
Recommendations
- A global exact penalty for rank-constrained optimization problem and applications
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- An Exact Penalization Viewpoint of Constrained Optimization
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Exact Regularization of Convex Programs
- An approximate exact penalty for vector inequality-constrained minimization problems
- Penalty decomposition methods for rank minimization
- scientific article; zbMATH DE number 841067
- An exact penalty approach for optimization with nonnegative orthogonality constraints
- The exact penalty map for nonsmooth and nonconvex optimization
Cites work
- $\ell _0$ Minimization for wavelet frame based image restoration
- 10.1162/153244303322753751
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- A Statistical View of Some Chemometrics Regression Tools
- An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
- Analysis of multi-stage convex relaxation for sparse regularization
- Atomic Decomposition by Basis Pursuit
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Calmness and Exact Penalization
- Computing a nearest correlation matrix with factor structure
- DC formulations and algorithms for sparse optimization problems
- Decoding by Linear Programming
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Error bounds for rank constrained optimization problems and applications
- Exact matrix completion via convex optimization
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- High-Resolution Radar via Compressed Sensing
- scientific article; zbMATH DE number 5161643 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Model selection and estimation in the Gaussian graphical model
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Penalty methods for a class of non-Lipschitz optimization problems
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Solution sets of three sparse optimization problems for multivariate regression
- Sparse Reconstruction by Separable Approximation
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(5)- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- Calmness of partial perturbation to composite rank constraint systems and its applications
- A global exact penalty for rank-constrained optimization problem and applications
- Penalty decomposition methods for rank minimization
- Exact penalization at d-stationary points of cardinality- or rank-constrained problem
This page was built for publication: Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882242)
