default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 188
Volume 188, Number 1, July 2021
- Kristóf Bérczi
, Tamás Schwarcz:
Complexity of packing common bases in matroids. 1-18 - Jérôme Bolte, Edouard Pauwels:
Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning. 19-51 - Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Separation routine and extended formulations for the stable set problem in claw-free graphs. 53-84 - Naman Agarwal, Nicolas Boumal, Brian Bullins, Coralia Cartis:
Adaptive regularization with cubics on manifolds. 85-134 - Robert M. Gower, Peter Richtárik, Francis R. Bach:
Stochastic quasi-gradient methods: variance reduction via Jacobian sketching. 135-192 - Andrés Gómez:
Strong formulations for conic quadratic optimization with indicator variables. 193-226 - Stephan Dempe, Nguyen Dinh, Joydeep Dutta, Tanushree Pandit:
Simple bilevel programming and extensions. 227-253 - David H. Gutman, Javier F. Peña:
The condition number of a function relative to a set. 255-294 - Loïc Seguin-Charbonneau, F. Bruce Shepherd:
Maximum edge-disjoint paths in planar graphs with congestion 2. 295-317 - Patrick Chervet, Roland Grappe, Louis-Hadrien Robert:
Box-total dual integrality, box-integrality, and equimodular matrices. 319-349 - Richard Y. Zhang, Javad Lavaei:
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. 351-393 - Deeparnab Chakrabarty, Sanjeev Khanna:
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling. 395-407 - Daniel R. Schmidt, Bernd Zey, François Margot:
Correction to: Stronger MIP formulations for the Steiner forest problem. 409-410
Volume 188, Number 2, August 2021
- Leo Liberti, Sebastian Sager, Angelika Wiegele:
Preface. 411-419 - Kurt M. Anstreicher, Samuel Burer:
Quadratic optimization with switching variables: the convex hull for n=2. 421-441 - Lucas Slot, Monique Laurent:
Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization. 443-460 - Thomas Kleinert, Veronika Grimm, Martin Schmidt:
Outer approximation for global optimization of mixed-integer quadratic bilevel problems. 461-521 - Timo Berthold, Zsolt Csizmadia:
The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers. 523-537 - Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee:
Mixing convex-optimization bounds for maximum-entropy sampling. 539-568 - Christian Kirches, Paul Manns, Stefan Ulbrich:
Compactness and convergence rates in the combinatorial integral approximation decomposition. 569-598 - Simone Göttlich, Falk M. Hante, Andreas Potschka, Lars Schewe:
Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints. 599-619 - Felix Bestehorn, Christoph Hansknecht, Christian Kirches, Paul Manns:
Mixed-integer optimal control problems with switching costs: a shortest path approach. 621-652 - Clemens Zeile, Nicolò Robuschi, Sebastian Sager:
Mixed-integer optimal control under minimum dwell time constraints. 653-694 - Fabian Gnegel, Armin Fügenschuh, Michael Hagel, Sven Leyffer, Marcus Stiemer:
A solution framework for linear PDE-constrained mixed-integer problems. 695-728
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-04 22:09 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:
