Mathematical Programming

Article	Citations
Towards an optimal contention resolution scheme for matchings	39
A characterization of maximal homogeneous-quadratic-free sets	37
Multiplicative updates for symmetric-cone factorizations	36
$$\mathcal {V}$$-polyhedral disjunctive cuts	35
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	33
A $$\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs	29
Optimal methods for convex nested stochastic composite optimization	27
Efficient separation of RLT cuts for implicit and explicit bilinear terms	26
Structural iterative rounding for generalized k-median problems	26
An adaptive proximal ADMM for nonconvex linearly constrained composite programs	25
The exact worst-case convergence rate of the alternating direction method of multipliers	25
A projection-free method for solving convex bilevel optimization problems	24
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	23
Shapes and recession cones in mixed-integer convex representability	22
Primal methods for variational inequality problems with functional constraints	22
Sum-of-squares relaxations for polynomial min–max problems over simple sets	21
Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization	21
Weak notions of nondegeneracy in nonlinear semidefinite programming	21
Stochastic algorithms with geometric step decay converge linearly on sharp functions	20
Correction to: The ancestral Benders’ cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming	19
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs	19
A new perspective on low-rank optimization	18
Polyhedral Newton-min algorithms for complementarity problems	18
A minimal face constant rank constraint qualification for reducible conic programming	18
Preference ambiguity and robustness in multistage decision making	18

A cutting-plane and benders’ decomposition algorithm for two-stage distributionally robust convex programs	16
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations	16
Constrained optimization of rank-one functions with indicator variables	16
A linear time algorithm for linearizing quadratic and higher-order shortest path problems	15
On the convergence rates of moment-SOS hierarchies approximation of truncated moment sequences	15
Tropical medians by transportation	15
Getting to the root of the problem: sums of squares for limits of trees	14
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity	14
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization	14
Stochastic algorithms for large-scale composite optimization: the case of likelihood maximization for X-FEL imaging	13
Exact computation of an error bound for the balanced linear complementarity problem with unique solution	13
A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem	13
Decomposition of probability marginals for security games in max-flow/min-cut systems	13
Homogeneous second-order descent framework: a fast alternative to Newton-type methods	13
A trust region method for noisy unconstrained optimization	12
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso	12
The computational complexity of finding stationary points in non-convex optimization	12
Special Issue: International Symposium on Mathematical Programming 2022	12
A simple and fast linear-time algorithm for divisor methods of apportionment	12
Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions	12
Relaxations and duality for multiobjective integer programming	12
On the resolution of cross-liabilities	12
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems	11
Faster margin maximization rates for generic and adversarially robust optimization methods	11
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs	11
Operator convexity along lines, self-concordance, and sandwiched Rényi entropies	11
Accelerated first-order methods for a class of semidefinite programs	10
Inexact subgradient methods for semialgebraic functions	10
A zonogon approach for computing small convex polygons of maximum perimeter	10
Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation	10
Inapproximability of shortest paths on perfect matching polytopes	10
A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron	10
Integer points in arbitrary convex cones: the case of the PSD and SOC cones	10
The effect of smooth parametrizations on nonconvex optimization landscapes	10
On tractability, complexity, and mixed-integer convex programming representability of distributionally favorable optimization	10
Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron	10
A continuous approximation model for the electric vehicle fleet sizing problem	9
New lower bounds on crossing numbers of $$K_{m,n}$$ from semidefinite programming	9
Fast Combinatorial Algorithms for Efficient Sortation	9
On the stationarity for nonlinear optimization problems with polyhedral constraints	9
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization	9
A Hessian-aware stochastic differential equation for modelling SGD	9
Low-rank mirror-prox methods for nonsmooth and low-rank matrix optimization problems	9
Low-rank optimization on Tucker tensor varieties	9
Zeroth-order optimization with orthogonal random directions	8
Online bipartite matching in the probe-commit model	8
Hyperbolicity cones are amenable	8
Fairness over time in dynamic resource allocation with an application in healthcare	8
The two-stripe symmetric circulant TSP is in P	8
On the partial convexification for low-rank spectral optimization: rank bounds and algorithms	8

Machine learning augmented branch and bound for mixed integer linear programming	8
Primal-dual proximal bundle and conditional gradient methods for convex problems	8
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles	8
$$\mathbf {2\times 2}$$-Convexifications for convex quadratic optimization with indicator variables	8
The mixed integer trust region problem	8
A gradient sampling algorithm for stratified maps with applications to topological data analysis	8
Geometry of vectorial martingale optimal transportations and duality	8
Quantifying low rank approximations of third order symmetric tensors	8
Cut-sufficient directed 2-commodity multiflow topologies	8
The complete edge relaxation for binary polynomial optimization	8
A novel reformulation for the single-sink fixed-charge transportation problem	8
Matrix discrepancy and the log-rank conjecture	7
Swarm gradient dynamics for global optimization: the mean-field limit case	7
On the strength of Burer’s lifted convex relaxation to quadratic programming with ball constraints	7
Stochastic Bregman Proximal Gradient Method Revisited: Kernel Conditioning and Painless Variance Reduction	7
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization	7
On the directional asymptotic approach in optimization theory	7
Lipschitz minimization and the Goldstein modulus	7
Efficient branching rules for optimizing range and order-based objective functions	7
Simple and fast algorithm for binary integer and online linear programming	7
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs	7
Capacitated facility location with outliers and uniform facility costs	7
Error bounds, facial residual functions and applications to the exponential cone	6
An abstract model for branch and cut	6
Learning and decision-making with data : optimal formulations and phase transitions	6
Advances on strictly $$\Delta $$-modular IPs	6
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems	6
Integer and unsplittable multiflows in series-parallel digraphs	6
Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis	6
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size	6
Totally $$\Delta $$-modular IPs with two non-zeros in most rows	6
Strongly-polynomial time and validation analysis of policy gradient methods	5
The density of planar sets avoiding unit distances	5
Level constrained first order methods for function constrained optimization	5
Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of Newton Method	5
Phragmén’s voting methods and justified representation	5
Cutoff stability under distributional constraints with an application to summer internship matching	5
An O(log n)-approximation algorithm for (p,q)-flexible graph connectivity via independent rounding	5
Non-asymptotic global convergence rates of BFGS with exact line search	5
Resolvent splitting for sums of monotone operators with minimal lifting	5
A parametric approach for solving convex quadratic optimization with indicators over trees	5
Lyapunov stability of the subgradient method with constant step size	5
Robust Stackelberg Equilibria	5
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs	5
Complexity of trust-region methods with potentially unbounded Hessian approximations for smooth and nonsmooth optimization	5
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints	5
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	5
A Reliability Theory of Compromise Decisions for Large-Scale Stochastic Programs	5
Gradient regularization of Newton method with Bregman distances	5
Finding global minima via kernel approximations	5
Assortment optimization with visibility constraints	5
Quadratic-form optimal transport	4
Optimizing distortion riskmetrics with distributional uncertainty	4
Beyond minimax optimality: A subgame perfect gradient method	4
Sharper exponential convergence rates for Sinkhorn’s algorithm in continuous settings	4
Exponential Lower Bounds for Many Pivot Rules for the Simplex Method	4
Correction: Efficient Kirszbraun extension with applications to regression	4
A normal fan projection algorithm for low-rank optimization	4
Projection onto hyperbolicity cones and beyond: a dual Frank-Wolfe approach	4
Bounding the optimal number of policies for robust K-Adaptability	4
Neighborhood persistency of the linear optimization relaxation of integer linear optimization	4
Level proximal subdifferential, variational convexity, and pointwise quadratic approximation	4
Short-step methods are not strongly polynomial-time	4
A PTAS for the horizontal rectangle stabbing problem	4
On Opial’s Lemma	4
An elementary approach to tight worst case complexity analysis of gradient based methods	4
Implied integrality in mixed-integer optimization	4
Intersecting and dense restrictions of clutters in polynomial time	4
Total dual dyadicness and dyadic generating sets	4
A second-order cone representable class of nonconvex quadratic programs	4
Convex envelopes of bounded monomials on two-variable cones	4
Breakdown points of Fermat–Weber problems under gauge distances	4
A characterization for tightness of the sparse Moment-SOS hierarchy	4
An online convex optimization-based framework for convex bilevel optimization	4
Optimizing for strategy diversity in the design of video games	4
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming	4
On the maximal number of columns of a $$\Delta $$-modular integer matrix: bounds and computations	4
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization	4
On circuit diameter bounds via circuit imbalances	4
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds	4

Smooth over-parameterized solvers for non-smooth structured optimization	4
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems	4
Stabilization of capacitated matching games	4
Finding almost tight witness trees	4
A first order method for linear programming parameterized by circuit imbalance	3
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty	3
Properties of two-stage stochastic multi-objective linear programs	3
A low-rank augmented Lagrangian method for polyhedral-SDP and moment-SOS relaxations of polynomial optimization	3
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid	3
Generalized Nash equilibrium problems with mixed-integer variables	3
Principled analyses and design of first-order methods with inexact proximal operators	3
Polynomial-time algorithms for multimarginal optimal transport problems with structure	3
Sparsity and proximity transference in integer programming	3
A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming	3
Adjustability in robust linear optimization	3
A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints	3
On the complexity of separating cutting planes for the knapsack polytope	3
Complexity of chordal conversion for sparse semidefinite programs with small treewidth	3
Correction: Global convergence of the gradient method for functions definable in o-minimal structures	3
Solving nonconvex optimization problems using outer approximations of the set-copositive cone	3
Adjustable robust nonlinear network design without controllable elements under load scenario uncertainties	3
A new complexity metric for nonconvex rank-one generalized matrix completion	3
McCormick envelopes in mixed-integer PDE-constrained optimization	3
Hessian averaging in stochastic Newton methods achieves superlinear convergence	3
Branch-and-bound for integer D-optimality with fast local search and variable-bound tightening	3
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling	3
Optimal item pricing in online combinatorial auctions	3
Distributional utility preference robust optimization models in multi-attribute decision making	3
High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise	3
New characterizations of strategy-proofness under single-peakedness	3
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems	3
Radial duality part I: foundations	3
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization	3
Graphs with $$G^p$$-connected medians	3
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis	3
Convergence rates for sums-of-squares hierarchies with correlative sparsity	3
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification	3
Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs	3
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles	3
Information complexity of mixed-integer convex optimization	3
k-median: exact recovery in the extended stochastic ball model	3
Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms	3
Provable non-accelerations of the heavy-ball method	3
Apportionment with parity constraints	3
Convex hulls of monomial curves, and a sparse positivstellensatz	3
Tight lower bounds for block-structured integer programs	3
Global optimization using random embeddings	3
FISTA is an automatic geometrically optimized algorithm for strongly convex functions	3
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k	3
Some primal-dual theory for subgradient methods for strongly convex optimization	3
Pairwise-independent contention resolution	3
Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces	3
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming	3
Fast convergence to non-isolated minima: four equivalent conditions for $${\textrm{C}^{2}}$$ functions	2
Pareto Adaptive Robust Optimality via a Fourier–Motzkin Elimination lens	2
Convergence in distribution of randomized algorithms: the case of partially separable optimization	2
Branch-and-bound solves random binary IPs in poly(n)-time	2
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022	2
Fair division of graphs and of tangled cakes	2
ALSO-X#: better convex approximations for distributionally robust chance constrained programs	2
(Near)-Optimal algorithms for sparse separable convex integer programs	2
Nonsmooth convex–concave saddle point problems with cardinality penalties	2
Trace ratio optimization with an application to multi-view learning	2
Reducing the large set threshold for Oertel’s conjecture on the mixed-integer volume	2
On the correlation gap of matroids	2
Graph coloring and semidefinite rank	2
Online combinatorial assignment in independence systems	2
Faster first-order primal-dual methods for linear programming using restarts and sharpness	2
Multiplicative auction algorithm for approximate maximum weight bipartite matching	2
Special Issue: Hierarchical Optimization	2
Homogenization of SGD in high-dimensions: exact dynamics and generalization properties	2
Preface	2
Robust convex optimization: A new perspective that unifies and extends	2
Dyadic linear programming and extensions	2
FPT algorithms for a special block-structured integer program with applications in scheduling	2
Mean–semideviation–based distributionally robust learning with weakly convex losses: convergence rates and finite-sample guarantees	2
Towards explicit superlinear convergence rate for SR1	2
Integral bases, perfect matchings, and the Petersen graph	2
Strongly convex maximization via the Frank-Wolfe algorithm with the Kurdyka-Łojasiewicz inequality	2
Discrete potential mean field games: duality and numerical resolution	2
Performance estimation for smooth and strongly convex sets	2
Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-time	2
Distributional stability of sparse inverse covariance matrix estimators	2
Publisher Correction to: A new perspective on low-rank optimization	2
Rectangularity and Duality of Distributionally Robust Markov Decision Processes	2
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning	2
State polynomials: positivity, optimization and nonlinear Bell inequalities	2
Optimizing over path-length matrices of unrooted binary trees	2
Efficient joint object matching via linear programming	2
Network flow problems with electric vehicles	2
Truly asymptotic lower bounds for online vector bin packing	2
Optimal gradient tracking for decentralized optimization	2
The Price of Adaptivity in Stochastic Convex Optimization	2
Sensitivity analysis for mixed binary quadratic programming	2
A semidefinite program for least distortion embeddings of flat tori into Hilbert spaces	2