Math. Program.

Keyphrases

Publications

volume 207, number 1, 2024

Alberto Del Pia, Aida Khajavirad
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs. Math. Program. 207 (1) (2024)
Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu
A polynomial time algorithm for finding a minimum 4-partition of a submodular function. Math. Program. 207 (1) (2024)
Igor Klep, Victor Magron, Jurij Volcic, Jie Wang
State polynomials: positivity, optimization and nonlinear Bell inequalities. Math. Program. 207 (1) (2024)
Alex Dunbar, Saumya Sinha, Andrew J. Schaefer
Relaxations and duality for multiobjective integer programming. Math. Program. 207 (1) (2024)
Haixiang Zhang, Baturalp Yalcin, Javad Lavaei, Somayeh Sojoudi
A new complexity metric for nonconvex rank-one generalized matrix completion. Math. Program. 207 (1) (2024)
Hananel Zaichyk, Armin Biess, Aryeh Kontorovich, Yury Makarychev
Efficient Kirszbraun extension with applications to regression. Math. Program. 207 (1) (2024)
Yan Li, Guanghui Lan, Tuo Zhao
Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity. Math. Program. 207 (1) (2024)
Daniel Brosch, Sven C. Polak
from semidefinite programming. Math. Program. 207 (1) (2024)
Yue Xie, Stephen J. Wright
Complexity of a projected Newton-CG method for optimization with bounds. Math. Program. 207 (1) (2024)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. 207 (1) (2024)
Gergely Ambrus, Adrián Csiszárik, Máté Matolcsi, Dániel Varga, Pál Zsámboki
The density of planar sets avoiding unit distances. Math. Program. 207 (1) (2024)
Liyuan Cao, Albert S. Berahas, Katya Scheinberg
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles. Math. Program. 207 (1) (2024)
Yong Sheng Soh, Antonios Varvitsiotis
Multiplicative updates for symmetric-cone factorizations. Math. Program. 207 (1) (2024)
Rohit Kannan, Güzin Bayraksan, James R. Luedtke
Residuals-based distributionally robust optimization with covariate information. Math. Program. 207 (1) (2024)
Manru Zong, Yin Tat Lee, Man-Chung Yue
Short-step methods are not strongly polynomial-time. Math. Program. 207 (1) (2024)
Hananel Zaichyk, Armin Biess, Aryeh Kontorovich, Yury Makarychev
Correction: Efficient Kirszbraun extension with applications to regression. Math. Program. 207 (1) (2024)
Jean-Pierre Dussault, Tangi Migot, Dominique Orban
Scalable adaptive cubic regularization methods. Math. Program. 207 (1) (2024)
Damek Davis, Dmitriy Drusvyatskiy, Vasileios Charisopoulos
Stochastic algorithms with geometric step decay converge linearly on sharp functions. Math. Program. 207 (1) (2024)
Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan
Optimal gradient tracking for decentralized optimization. Math. Program. 207 (1) (2024)
Cédric Josz, Lexiao Lai
Global stability of first-order methods for coercive tame functions. Math. Program. 207 (1) (2024)
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. Math. Program. 207 (1) (2024)

volume 206, number 1, 2024

Max Gläser, Marc E. Pfetsch
On computing small variable disjunction branch-and-bound trees. Math. Program. 206 (1) (2024)
Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
Faster goal-oriented shortest path search for bulk and incremental detailed routing. Math. Program. 206 (1) (2024)
Karen I. Aardal, Laura Sanità
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022. Math. Program. 206 (1) (2024)
Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan
An abstract model for branch and cut. Math. Program. 206 (1) (2024)
Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
Matroid-based TSP rounding for half-integral solutions. Math. Program. 206 (1) (2024)
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds. Math. Program. 206 (1) (2024)
Martin Drees
Intersecting and dense restrictions of clutters in polynomial time. Math. Program. 206 (1) (2024)
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Math. Program. 206 (1) (2024)
Meike Neuwohner
The limits of local search for weighted k-set packing. Math. Program. 206 (1) (2024)
Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou
A competitive algorithm for throughput maximization on identical machines. Math. Program. 206 (1) (2024)
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
Total dual dyadicness and dyadic generating sets. Math. Program. 206 (1) (2024)
Eric Balkanski, Yuri Faenza, Mathieu Kubik
The simultaneous semi-random model for TSP. Math. Program. 206 (1) (2024)
Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
On the complexity of separating cutting planes for the knapsack polytope. Math. Program. 206 (1) (2024)
Renee Mirka, Devin Smedira, David P. Williamson
Graph coloring and semidefinite rank. Math. Program. 206 (1) (2024)
Alberto Del Pia, Matthias Walter
Simple odd β-cycle inequalities for binary polynomial optimization. Math. Program. 206 (1) (2024)
Arindam Khan, Aditya Subramanian, Andreas Wiese
A PTAS for the horizontal rectangle stabbing problem. Math. Program. 206 (1) (2024)
Omar El Housni, Ayoub Foussoul, Vineet Goyal
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization. Math. Program. 206 (1) (2024)
José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg
Optimal item pricing in online combinatorial auctions. Math. Program. 206 (1) (2024)
Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. Math. Program. 206 (1) (2024)
Sammy Khalife, Hongyu Cheng, Amitabh Basu
Neural networks with linear threshold activations: structure and algorithms. Math. Program. 206 (1) (2024)
Gennadiy Averkov, Matthias Schymura
On the maximal number of columns of a Δ-modular integer matrix: bounds and computations. Math. Program. 206 (1) (2024)
Rui Chen, James R. Luedtke
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables. Math. Program. 206 (1) (2024)
Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
A simple method for convex optimization in the oracle model. Math. Program. 206 (1) (2024)
Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
On circuit diameter bounds via circuit imbalances. Math. Program. 206 (1) (2024)

volume 205, number 1, 2024