From approximate to exact integer programming Daniel DadushFriedrich EisenbrandThomas Rothvoss Full Length Paper Open access 24 April 2024
Graph coloring and semidefinite rank Renee MirkaDevin SmediraDavid P. Williamson Full Length Paper 24 April 2024
A normal fan projection algorithm for low-rank optimization James R. ScottJoseph Geunes Full Length Paper 23 April 2024
An update-and-stabilize framework for the minimum-norm-point problem Satoru FujishigeTomonari KitaharaLászló A. Végh Full Length Paper Open access 18 April 2024
Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems Sebastian LämmelVladimir Shikhman Full Length Paper Open access 09 April 2024
Non-convex scenario optimization Simone GarattiMarco C. Campi Full Length Paper Open access 08 April 2024
Compressing branch-and-bound trees Gonzalo MuñozJoseph PaatÁlinson S. Xavier Full Length Paper 06 April 2024
Finding global minima via kernel approximations Alessandro RudiUlysse Marteau-FereyFrancis Bach Full Length Paper 04 April 2024
Convergence rates for sums-of-squares hierarchies with correlative sparsity Milan KordaVictor MagronRodolfo Ríos-Zertuche Full Length Paper Open access 25 March 2024
Accelerated first-order methods for a class of semidefinite programs Alex L. WangFatma Kılınç-Karzan Full Length Paper 22 March 2024
Sum-of-squares relaxations for polynomial min–max problems over simple sets Francis Bach Full Length Paper 15 March 2024
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints Samuel Burer Full Length Paper 14 March 2024
Perseus: a simple and optimal high-order method for variational inequalities Tianyi LinMichael I. Jordan Full Length Paper 13 March 2024
Generalized Nash equilibrium problems with mixed-integer variables Tobias HarksJulian Schwarz Full Length Paper Open access 13 March 2024
The Chvátal–Gomory procedure for integer SDPs with applications in combinatorial optimization Frank de MeijerRenata Sotirov Full Length Paper Open access 13 March 2024
Generalized minimum 0-extension problem and discrete convexity Martin DvorakVladimir Kolmogorov Full Length Paper Open access 07 March 2024
Matroid-based TSP rounding for half-integral solutions Anupam GuptaEuiwoong LeeSherry Sarkar Full Length Paper Open access 06 March 2024
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization Yaohua HuXinlin HuXiaoqi Yang Full Length Paper Open access 06 March 2024
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations Yuzhou QiuE. Alper Yıldırım Full Length Paper Open access 06 March 2024
Multiplicative auction algorithm for approximate maximum weight bipartite matching Da Wei ZhengMonika Henzinger Full Length Paper 06 March 2024
Level constrained first order methods for function constrained optimization Digvijay BoobQi DengGuanghui Lan Full Length Paper Open access 06 March 2024
Hessian barrier algorithms for non-convex conic optimization Pavel DvurechenskyMathias Staudigl Full Length Paper Open access 04 March 2024
The effect of smooth parametrizations on nonconvex optimization landscapes Eitan LevinJoe KileelNicolas Boumal Full Length Paper Open access 04 March 2024
Automated tight Lyapunov analysis for first-order methods Manu UpadhyayaSebastian BanertPontus Giselsson Full Length Paper Open access 26 February 2024
Submodular maximization and its generalization through an intersection cut lens Liding XuLeo Liberti Full Length Paper 19 February 2024
Deciding whether a lattice has an orthonormal basis is in co-NP Christoph Hunkenschröder Short Communication Open access 19 February 2024
Convex hulls of monomial curves, and a sparse positivstellensatz Gennadiy AverkovClaus Scheiderer Full Length Paper Open access 16 February 2024
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization Michelangelo BinIvano NotarnicolaThomas Parisini Full Length Paper Open access 12 February 2024
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods Masoud AhookhoshYurii Nesterov Correction Open access 10 February 2024
A general framework for multi-marginal optimal transport Brendan PassAdolfo Vargas-Jiménez Full Length Paper 05 February 2024
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems Liaoyuan ZengYongle ZhangXiaozhou Wang Full Length Paper 03 February 2024
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization Simon ThomäGrit WaltherMaximilian Schiffer Full Length Paper Open access 03 February 2024
A constant-factor approximation for generalized malleable scheduling under \(M ^{\natural }\)-concave processing speeds Dimitris FotakisJannik MatuschkeOrestis Papadigenopoulos Full Length Paper 29 January 2024
Adjustability in robust linear optimization Ningji WeiPeter Zhang Full Length Paper Open access 27 January 2024
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski Mourad BaïouJosé CorreaRida Laraki Preface 24 January 2024 Pages: 1 - 7
Correction: Efficient Kirszbraun extension with applications to regression Hananel ZaichykArmin BiessYury Makarychev Correction 20 January 2024
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming Marcin BriańskiMartin KouteckýFelix Schröder Full Length Paper Open access 20 January 2024
Constrained optimization of rank-one functions with indicator variables Soroosh ShafieeFatma Kılınç-Karzan Full Length Paper 20 January 2024
A competitive algorithm for throughput maximization on identical machines Benjamin MoseleyKirk PruhsRudy Zhou Full Length Paper Open access 10 January 2024
Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions” Charles AudetPierre-Yves BouchetLoïc Bourdin Full Length Paper 08 January 2024
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians Lai TianAnthony Man-Cho So Full Length Paper 06 January 2024
Complementary composite minimization, small gradients in general norms, and applications Jelena DiakonikolasCristóbal Guzmán Full Length Paper 05 January 2024
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods Masoud AhookhoshYurii Nesterov Full Length Paper Open access 04 January 2024
FPT algorithms for a special block-structured integer program with applications in scheduling Hua ChenLin ChenGuochuan Zhang Full Length Paper 04 January 2024
A 2-approximation for the bounded treewidth sparsest cut problem in \(\textsf{FPT}\) Time Vincent Cohen-AddadTobias MömkeVictor Verdugo Full Length Paper 04 January 2024
Asymmetry in the complexity of the multi-commodity network pricing problem Quang Minh BuiMargarida CarvalhoJosé Neto Full Length Paper 03 January 2024
The exact worst-case convergence rate of the alternating direction method of multipliers Moslem ZamaniHadi AbbaszadehpeivastiEtienne de Klerk Full Length Paper Open access 26 December 2023
First order asymptotics of the sample average approximation method to solve risk averse stochastic programs Volker Krätschmer Full Length Paper Open access 26 December 2023
Beyond symmetry: best submatrix selection for the sparse truncated SVD Yongchun LiWeijun Xie Full Length Paper 21 December 2023
