Structural properties of affine sparsity constraints

DOI10.1007/s10107-018-1283-3zbMath1415.90087MaRDI 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

zbMATH Keywords

nonconvex optimization; set convergence; B(ouligand) stationary points; sparsity systems

Mathematics Subject Classification ID

62J05: Linear regression; mixed models

90C90: Applications of mathematical programming

90C26: Nonconvex programming, global optimization

Related Items

Composite Difference-Max Programs for Modern Statistical Estimation Problems

Uses Software

• glasso
• hierNet

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