Ideal formulations for constrained convex optimization problems with indicator variables

Motivated by modern regression applications, in this paper, we study the convexification of a class of convex optimization problems with indicator variables and combinatorial constraints on the indicators. Unlike most of the previous work on convexification of sparse regression problems, we simultan...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 192; no. 1-2; pp. 57 - 88
Main Authors:	Wei, Linchuan, Gómez, Andrés, Küçükyavuz, Simge
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022 Springer Springer Nature B.V
Subjects:	Calculus of Variations and Optimal Control; Optimization Collinearity Combinatorial analysis Combinatorics Computational geometry Constraints Convex analysis Convexity Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Regression Theoretical Perspective formulation Combinatorial constraints Convexification Indicator variables
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!