Shitov, Yaroslav Nonnegative rank depends on the field. (English) Zbl 1465.15044 Math. Program. 186, No. 1-2 (A), 479-486 (2021). Reviewer: Janko Marovt (Maribor) MSC: 15B48 15A03 15A23 52B12 52B40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Backlinks: MO
Allen-Zhu, Zeyuan; Li, Yuanzhi; Singh, Aarti; Wang, Yining Near-optimal discrete optimization for experimental design: a regret minimization approach. (English) Zbl 1459.90172 Math. Program. 186, No. 1-2 (A), 439-478 (2021). MSC: 90C27 62K05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Nobili, Paolo; Sassano, Antonio An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs. (English) Zbl 1458.05203 Math. Program. 186, No. 1-2 (A), 409-437 (2021). MSC: 05C69 05C85 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Schmidt, Daniel; Zey, Bernd; Margot, François Stronger MIP formulations for the Steiner forest problem. (English) Zbl 1459.90188 Math. Program. 186, No. 1-2 (A), 373-407 (2021). MSC: 90C27 90C57 90B10 × Cite Format Result Cite Review PDF Full Text: DOI OA License
Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem. (English) Zbl 1459.90129 Math. Program. 186, No. 1-2 (A), 337-372 (2021). MSC: 90C10 90C57 90C90 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Chen, Xin; Pittel, Boris On sparsity of the solution to a random quadratic optimization problem. (English) Zbl 1459.90143 Math. Program. 186, No. 1-2 (A), 309-336 (2021). MSC: 90C20 90C26 15B52 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Boyd, Sylvia; Sebő, András The salesman’s improved tours for fundamental classes. (English) Zbl 1459.90175 Math. Program. 186, No. 1-2 (A), 289-307 (2021). MSC: 90C27 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Haeser, Gabriel; Hinder, Oliver; Ye, Yinyu On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. (English) Zbl 1459.90152 Math. Program. 186, No. 1-2 (A), 257-288 (2021). MSC: 90C25 90C30 90C46 90C51 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Padmanabhan, Divya; Natarajan, Karthik; Murthy, Karthyek Exploiting partial correlations in distributionally robust optimization. (English) Zbl 1459.90140 Math. Program. 186, No. 1-2 (A), 209-255 (2021). MSC: 90C17 90C11 90C22 90-02 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Garber, Dan; Kaplan, Atara; Sabach, Shoham Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems. (English) Zbl 1459.90146 Math. Program. 186, No. 1-2 (A), 185-208 (2021). MSC: 90C22 90C17 90C06 68W27 68W20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Nesterov, Yurii Implementable tensor methods in unconstrained convex optimization. (English) Zbl 1459.90157 Math. Program. 186, No. 1-2 (A), 157-183 (2021). MSC: 90C25 90C06 65K05 × Cite Format Result Cite Review PDF Full Text: DOI OA License
Xie, Weijun On distributionally robust chance constrained programs with Wasserstein distance. (English) Zbl 1459.90141 Math. Program. 186, No. 1-2 (A), 115-155 (2021). MSC: 90C17 90C47 90C11 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Chandrasekaran, Karthekeyan; Xu, Chao; Yu, Xilin Hypergraph \(k\)-cut in randomized polynomial time. (English) Zbl 1459.90176 Math. Program. 186, No. 1-2 (A), 85-113 (2021). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Gürbüzbalaban, M.; Ozdaglar, A.; Parrilo, P. A. Why random reshuffling beats stochastic gradient descent. (English) Zbl 1459.90199 Math. Program. 186, No. 1-2 (A), 49-84 (2021). MSC: 90C30 90C06 90C25 90C15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Lourenço, Bruno F. Amenable cones: error bounds without constraint qualifications. (English) Zbl 1459.90205 Math. Program. 186, No. 1-2 (A), 1-48 (2021). MSC: 90C31 65G99 17C55 × Cite Format Result Cite Review PDF Full Text: DOI arXiv