Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 195
Volume 195, Number 1, September 2022
- Man-Chung Yue
, Daniel Kuhn, Wolfram Wiesemann:
On linear optimization over Wasserstein balls. 1107-1122 - Hiroshi Hirai, Yuni Iwamasa:
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices. 1-37 - Dimitris Bertsimas, Bart P. G. Van Parys:
Bootstrap robust prescriptive analytics. 39-78 - Bin Shi, Simon S. Du, Michael I. Jordan, Weijie J. Su:
Understanding the acceleration phenomenon via high-resolution differential equations. 79-148 - Hiroshi Hirai, Motoki Ikeda:
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem. 149-181 - Nir Halman, Giacomo Nannicini:
Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs. 183-242 - Murat A. Erdogdu, Asuman E. Ozdaglar, Pablo A. Parrilo, Nuri Denizcan Vanli:
Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs. 243-281 - Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee:
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. 283-326 - M. Paul Laiu, André L. Tits:
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods. 327-366 - Kanstantsin Pashkovich:
Computing the nucleolus of weighted voting games in pseudo-polynomial time. 1123-1133 - Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau:
Empowering the configuration-IP: new PTAS results for scheduling with setup times. 367-401 - Naveen Garg, Nikhil Kumar, András Sebö:
Integer plane multiflow maximisation: one-quarter-approximation and gaps. 403-419 - Haixiang Zhang, Andre Milzarek, Zaiwen Wen, Wotao Yin:
On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint. 421-473 - Andreas Bärmann, Oskar Schneider:
Set characterizations and convex extensions for geometric convex-hull proofs. 475-515 - Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros:
Worst-case analysis of clique MIPs. 517-551 - Jérôme Bolte, Edouard Pauwels:
Curiosities and counterexamples in smooth convex optimization. 553-603 - Veronika Grimm, Daniel Nowak, Lars Schewe, Martin Schmidt, Alexandra Schwartz, Gregor Zöttl:
A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction. 605-647 - Junyu Zhang, Lin Xiao:
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization. 649-691 - Vivak Patel:
Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions. 693-734 - András Frank, Kazuo Murota:
Decreasing minimization on M-convex sets: algorithms and applications. 1027-1068 - Hao Luo, Long Chen:
From differential equation solvers to accelerated first-order methods for convex optimization. 735-781 - Amir Ali Ahmadi, Jeffrey Zhang:
On the complexity of finding a local minimizer of a quadratic function over a polytope. 783-792 - Peng Wang, Zirui Zhou, Anthony Man-Cho So:
Non-convex exact community recovery in stochastic block model. 1-37 - Satoru Fujishige, Fabio Tardella:
Discrete 2-convex functions. 831-854 - Heinz H. Bauschke, Hui Ouyang, Xianfu Wang:
Best approximation mappings in Hilbert spaces. 855-901 - Chen Zhao, Naihua Xiu, Houduo Qi, Ziyan Luo:
A Lagrange-Newton algorithm for sparse nonlinear programming. 903-928 - Tianyi Lin, Michael I. Jordan:
A control-theoretic perspective on optimal high-order optimization. 929-975 - András Frank, Kazuo Murota:
Decreasing minimization on M-convex sets: background and structures. 977-1025 - Kanstantsin Pashkovich, Laurent Poirrier, Haripriya Pulyassary:
The aggregation closure is polyhedral for packing and covering integer programs. 1135-1147 - Adrián Esteban-Pérez, Juan M. Morales:
Distributionally robust stochastic programs with side information based on trimmings. 1069-1105
a service of 
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 2024-05-05 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
