Algorithm for cardinality-constrained quadratic optimization
By Dimitris J. Bertsimas, Romy Shioda. 2009
279 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Management Science and Operations Research, Numerical Analysis
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Pietro Belotti
- Rahul Mazumder
- Xiaoling Sun
- Angela King
- Xiaojin Zheng
- Duan Li
- Dimitris J. Bertsimas
- Tamás Terlaky
In Management Science and Operations Research
- Duan Li
- Rahul Mazumder
- Xiaoling Sun
- Angela King
- Xiaojin Zheng
- Dimitris J. Bertsimas
- Tamás Terlaky
- Xun Yu Zhou
In Numerical Analysis
- Duan Li
- Rahul Mazumder
- Angela King
- Xiaoling Sun
- Xiaojin Zheng
- Pietro Belotti
- Dimitris J. Bertsimas
- Tamás Terlaky
Citations in the corpus
- Best Subset Selection via a Modern Optimization Lens (2015, methodology): “The proposal of Bertsimas and Shioda (2009) concentrates on obtaining high quality upper bounds for problem (1.1) and is less scalable than the methods presented in this paper.”
- Recent Advances in Mathematical Programming with Semi-continuous Variables and Cardinality Constraint (2013, methodology): “Bertsimas and Shioda [6] proposed a branch-and-bound method where the continuous subproblem at each node is solved by Lemke’s pivoting method.”
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (2015, background): “A very important class of MICO is the class of Mixed Integer Second Order Cone Optimization (MISOCO) problems, which find applications in engineering, finance and inventory problems [1, 10, 16, 20].”