default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 186
Volume 186, Number 1, March 2021
- Bruno F. Lourenço
:
Amenable cones: error bounds without constraint qualifications. 1-48 - Mert Gürbüzbalaban, Asuman E. Ozdaglar, Pablo A. Parrilo:
Why random reshuffling beats stochastic gradient descent. 49-84 - Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu:
Hypergraph k-cut in randomized polynomial time. 85-113 - Weijun Xie:
On distributionally robust chance constrained programs with Wasserstein distance. 115-155 - Yurii E. Nesterov:
Implementable tensor methods in unconstrained convex optimization. 157-183 - Dan Garber, Atara Kaplan, Shoham Sabach:
Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems. 185-208 - Divya Padmanabhan, Karthik Natarajan, Karthyek Murthy:
Exploiting partial correlations in distributionally robust optimization. 209-255 - Gabriel Haeser, Oliver Hinder, Yinyu Ye:
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. 257-288 - Sylvia C. Boyd, András Sebö:
The salesman's improved tours for fundamental classes. 289-307 - Xin Chen, Boris G. Pittel:
On sparsity of the solution to a random quadratic optimization problem. 309-336 - Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem. 337-372 - Daniel R. Schmidt, Bernd Zey, François Margot:
Stronger MIP formulations for the Steiner forest problem. 373-407 - Paolo Nobili, Antonio Sassano:
An 풪(n2 log n) algorithm for the weighted stable set problem in claw-free graphs. 409-437 - Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, Yining Wang:
Near-optimal discrete optimization for experimental design: a regret minimization approach. 439-478 - Yaroslav Shitov:
Nonnegative rank depends on the field. 479-486
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 00:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
