Structural properties of affine sparsity constraints
From MaRDI portal
Publication:2425165
DOI10.1007/s10107-018-1283-3zbMath1415.90087OpenAlexW2799581025MaRDI QIDQ2425165
Jong-Shi Pang, Hongbo Dong, Miju Ahn
Publication date: 26 June 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1283-3
Linear regression; mixed models (62J05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)
Related Items
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization ⋮ Composite Difference-Max Programs for Modern Statistical Estimation Problems ⋮ Unnamed Item ⋮ Linear-step solvability of some folded concave and singly-parametric sparse optimization problems ⋮ A strong sequential optimality condition for cardinality-constrained optimization problems ⋮ Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations ⋮ Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems ⋮ On integer and MPCC representability of affine sparsity ⋮ Sequential optimality conditions for cardinality-constrained optimization problems with applications ⋮ An augmented Lagrangian method for cardinality-constrained optimization problems ⋮ Penalty and Augmented Lagrangian Methods for Constrained DC Programming ⋮ Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Sparse inverse covariance estimation with the graphical lasso
- Best subset selection via a modern optimization lens
- DC approximation approaches for sparse optimization
- A lasso for hierarchical interactions
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Algorithm for cardinality-constrained quadratic optimization
- The composite absolute penalties family for grouped and hierarchical variable selection
- Computational study of a family of mixed-integer quadratic programming problems
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- Computing B-Stationary Points of Nonsmooth DC Programs
- Sparse and stable Markowitz portfolios
- First-Order Methods for Sparse Covariance Selection
- A class of logic problems solvable by linear programming
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Some properties of regularization and penalization schemes for MPECs
- Sparsity and Smoothness Via the Fused Lasso
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Mixed-integer nonlinear optimization
- Model Selection and Estimation in Regression with Grouped Variables
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Structured sparsity through convex optimization
- A selective review of group selection in high-dimensional models
