research
∙
09/19/2022
State-driven Implicit Modeling for Sparsity and Robustness in Neural Networks
Implicit models are a general class of learning models that forgo the hi...
share
research
∙
08/07/2022
Parabolic Relaxation for Quadratically-constrained Quadratic Programming – Part II: Theoretical Computational Results
In the first part of this work [32], we introduce a convex parabolic rel...
research
∙
08/07/2022
Parabolic Relaxation for Quadratically-constrained Quadratic Programming – Part I: Definitions Basic Properties
For general quadratically-constrained quadratic programming (QCQP), we p...
research
∙
02/01/2022
Safe Screening for Logistic Regression with â„“_0-â„“_2 Regularization
In logistic regression, it is often desirable to utilize regularization ...
research
∙
01/02/2022
On the convex hull of convex quadratic optimization problems with indicators
We consider the convex quadratic optimization problem with indicator var...
research
∙
12/29/2020
Supermodularity and valid inequalities for quadratic optimization with indicators
We study the minimization of a rank-one quadratic with indicators and sh...
research
∙
04/19/2020
Safe Screening Rules for â„“_0-Regression
We give safe screening rules to eliminate variables from regression with...
research
∙
12/31/2019
Submodular Function Minimization and Polarity
Using polarity, we give an outer polyhedral approximation for the epigra...
research
∙
01/29/2019
Rank-one Convexification for Sparse Regression
Sparse regression models are increasingly prevalent due to their ease of...
research
∙
11/06/2018
