default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 175
Volume 175, Numbers 1-2, May 2019
- Wim van Ackooij
, Jérôme Malick:
Eventual convexity of probability constraints with elliptical distributions. 1-27 - Xiao Liu, Fatma Kilinç-Karzan, Simge Küçükyavuz:
On intersection of two mixing sets with applications to joint chance-constrained programs. 29-68 - Ion Necoara, Yurii E. Nesterov, François Glineur:
Linear convergence of first order methods for non-strongly convex optimization. 69-107 - Hamza Fawzi:
On representing the positive semidefinite cone using the second-order cone. 109-118 - Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling, proximity, and optimization of integrally convex functions. 119-154 - Andrew C. Eberhard, Yousong Luo, Shuai Liu:
On partial smoothness, tilt stability and the VU -decomposition. 155-196 - Christopher Hojny, Marc E. Pfetsch:
Polytopes associated with symmetry handling. 197-240 - Mario Bravo, Roberto Cominetti, Matías Pavez-Signé:
Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces. 241-262 - Yu Zhang, Roberto Baldacci, Melvyn Sim, Jiafu Tang:
Routing optimization with time windows under uncertainty. 263-305 - Zeyuan Allen-Zhu, Lorenzo Orecchia:
Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence. 307-353 - Warren Adams, Akshay Gupte, Yibo Xu:
Error bounds for monomial convexification in polynomial optimization. 355-393 - Xudong Li, Defeng Sun, Kim-Chuan Toh:
A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications. 395-418 - Francis R. Bach:
Submodular functions: from discrete to continuous domains. 419-459 - Jikai Zou, Shabbir Ahmed, Xu Andy Sun:
Stochastic dual dynamic integer programming. 461-502 - Natashia Boland, Jeffrey Christiansen, Brian C. Dandurand, Andrew C. Eberhard, Fabricio Oliveira:
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems. 503-536
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 2025-12-19 01:19 CET 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:
