Structural properties of affine sparsity constraints
From MaRDI portal
Publication:2425165
DOI10.1007/S10107-018-1283-3zbMATH Open1415.90087OpenAlexW2799581025MaRDI QIDQ2425165FDOQ2425165
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
Recommendations
- On integer and MPCC representability of affine sparsity
- Sparsity constrained optimization problems via disjunctive programming
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- On solutions of sparsity constrained optimization
- The first-order necessary conditions for sparsity constrained optimization
Linear regression; mixed models (62J05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)
Cites Work
- A lasso for hierarchical interactions
- Nearly unbiased variable selection under minimax concave penalty
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Best subset selection via a modern optimization lens
- Analysis of multi-stage convex relaxation for sparse regularization
- Title not available (Why is that?)
- Variational Analysis
- Sparsity and Smoothness Via the Fused Lasso
- Mixed-integer nonlinear optimization
- Model Selection and Estimation in Regression with Grouped Variables
- Sparse inverse covariance estimation with the graphical lasso
- Title not available (Why is that?)
- Structured sparsity through convex optimization
- The composite absolute penalties family for grouped and hierarchical variable selection
- A selective review of group selection in high-dimensional models
- First-Order Methods for Sparse Covariance Selection
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Title not available (Why is that?)
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Computational study of a family of mixed-integer quadratic programming problems
- Sparse and stable Markowitz portfolios
- Algorithm for cardinality-constrained quadratic optimization
- DC approximation approaches for sparse optimization
- Some properties of regularization and penalization schemes for MPECs
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
- A class of logic problems solvable by linear programming
- Balanced matrices
- Computing B-Stationary Points of Nonsmooth DC Programs
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
Cited In (18)
- Restricted normal cones and sparsity optimization with affine constraints
- Cardinality minimization, constraints, and regularization: a survey
- On integer and MPCC representability of affine sparsity
- Penalty and Augmented Lagrangian Methods for Constrained DC Programming
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
- Sequential M-stationarity conditions for general optimization problems
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations
- Title not available (Why is that?)
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Relaxation approaches for nonlinear sparse optimization problems
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- An augmented Lagrangian method for cardinality-constrained optimization problems
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- Ideal formulations for constrained convex optimization problems with indicator variables
- A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization
- Copositivity and sparsity relations using spectral properties
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- A strong sequential optimality condition for cardinality-constrained optimization problems
Uses Software
This page was built for publication: Structural properties of affine sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425165)
