Mathematical Programming

Article	Citations
Affinely representable lattices, stable matchings, and choice functions	64
Efficient separation of RLT cuts for implicit and explicit bilinear terms	29
An $$O(s^r)$$-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems	27
A characterization of maximal homogeneous-quadratic-free sets	27
Towards an optimal contention resolution scheme for matchings	27
On the integrality gap of binary integer programs with Gaussian data	25
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations	24
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	21
A projection-free method for solving convex bilevel optimization problems	20
The exact worst-case convergence rate of the alternating direction method of multipliers	19
Optimal methods for convex nested stochastic composite optimization	19
Multiplicative updates for symmetric-cone factorizations	19
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings	18
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	18
Structural iterative rounding for generalized k-median problems	18
On the robustness of potential-based flow networks	18
Preference ambiguity and robustness in multistage decision making	17
Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs	17
Nonlinear acceleration of momentum and primal-dual algorithms	16
Subgradient ellipsoid method for nonsmooth convex problems	16
Fixed parameter approximation scheme for min-max k-cut	16
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs	15
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations	15
Tropical medians by transportation	15
Shapes and recession cones in mixed-integer convex representability	15

Weak notions of nondegeneracy in nonlinear semidefinite programming	15
Constrained optimization of rank-one functions with indicator variables	14
Sum-of-squares relaxations for polynomial min–max problems over simple sets	14
Graph coloring with decision diagrams	14
A new perspective on low-rank optimization	13
Correction to: Equilibrium computation in resource allocation games	13
Correction to: The ancestral Benders’ cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming	13
Primal methods for variational inequality problems with functional constraints	13
Stochastic algorithms with geometric step decay converge linearly on sharp functions	13
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens	13
Sequence independent lifting for a set of submodular maximization problems	12
A trust region method for noisy unconstrained optimization	12
On linear optimization over Wasserstein balls	12
On the optimality of pseudo-polynomial algorithms for integer programming	12
A linear time algorithm for linearizing quadratic and higher-order shortest path problems	12
A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem	12
Decomposition of probability marginals for security games in max-flow/min-cut systems	12
Discrete 2-convex functions	11
Exact computation of an error bound for the balanced linear complementarity problem with unique solution	11
The computational complexity of finding stationary points in non-convex optimization	11
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems	11
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization	11
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity	11
Tight approximation bounds for maximum multi-coverage	10
Decreasing minimization on M-convex sets: algorithms and applications	10
Special Issue: International Symposium on Mathematical Programming 2022	10
A simple and fast linear-time algorithm for divisor methods of apportionment	10
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs	10
Identifying optimal strategies in kidney exchange games is $$\varSigma _2^p$$-complete	10
Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation	10
On the resolution of cross-liabilities	9
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso	9
Decreasing minimization on M-convex sets: background and structures	9
Relaxations and duality for multiobjective integer programming	9
Solving sparse principal component analysis with global support	9
Accelerated first-order methods for a class of semidefinite programs	9
Machine learning augmented branch and bound for mixed integer linear programming	9
The effect of smooth parametrizations on nonconvex optimization landscapes	9
How many matchings cover the nodes of a graph?	9
Approximating the discrete time-cost tradeoff problem with bounded depth	8
Integer points in arbitrary convex cones: the case of the PSD and SOC cones	8
Unifying mirror descent and dual averaging	8
A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction	8
The computation of pairwise stable networks	8
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization	8
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier	8
A continuous approximation model for the electric vehicle fleet sizing problem	8
New lower bounds on crossing numbers of $$K_{m,n}$$ from semidefinite programming	8
Low-rank optimization on Tucker tensor varieties	8
Arboricity games: the core and the nucleolus	7

On the complexity of finding a local minimizer of a quadratic function over a polytope	7
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles	7
A gradient sampling algorithm for stratified maps with applications to topological data analysis	7
Hyperbolicity cones are amenable	7
On the stationarity for nonlinear optimization problems with polyhedral constraints	7
Cut-sufficient directed 2-commodity multiflow topologies	7
Geometry of vectorial martingale optimal transportations and duality	7
Quantifying low rank approximations of third order symmetric tensors	7
Inapproximability of shortest paths on perfect matching polytopes	7
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours	7
The maximin support method: an extension of the D’Hondt method to approval-based multiwinner elections	7
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints	7
Affine-invariant contracting-point methods for Convex Optimization	6
Matrix discrepancy and the log-rank conjecture	6
Optimization on flag manifolds	6
Online bipartite matching in the probe-commit model	6
Implications, conflicts, and reductions for Steiner trees	6
A novel reformulation for the single-sink fixed-charge transportation problem	6
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization	6
A graph-based decomposition method for convex quadratic optimization with indicators	6
Revisiting augmented Lagrangian duals	6
Zeroth-order optimization with orthogonal random directions	6
Fairness over time in dynamic resource allocation with an application in healthcare	6
A finite characterization of perfect equilibria	6
Swarm gradient dynamics for global optimization: the mean-field limit case	6
The mixed integer trust region problem	6
$$\mathbf {2\times 2}$$-Convexifications for convex quadratic optimization with indicator variables	6
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization	6
Simple and fast algorithm for binary integer and online linear programming	6
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size	5
Advances on strictly $$\Delta $$-modular IPs	5
The density of planar sets avoiding unit distances	5
Complexity of branch-and-bound and cutting planes in mixed-integer optimization	5
Chance-constrained set covering with Wasserstein ambiguity	5
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs	5
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints	5
An abstract model for branch and cut	5
Graphical designs and gale duality	5
Bootstrap robust prescriptive analytics	5
Non-convex nested Benders decomposition	5
On the directional asymptotic approach in optimization theory	5
Resolvent splitting for sums of monotone operators with minimal lifting	5
On lower iteration complexity bounds for the convex concave saddle point problems	5
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	5
Multicriteria cuts and size-constrained k-cuts in hypergraphs	5
Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis	5
The two-stripe symmetric circulant TSP is in P	5
A convergence analysis of the price of anarchy in atomic congestion games	5
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems	5
Sublinear circuits and the constrained signomial nonnegativity problem	5
Error bounds, facial residual functions and applications to the exponential cone	5
Level constrained first order methods for function constrained optimization	5
Vertex downgrading to minimize connectivity	5
Gradient regularization of Newton method with Bregman distances	4
About the complexity of two-stage stochastic IPs	4
Total dual dyadicness and dyadic generating sets	4
Phragmén’s voting methods and justified representation	4
On circuit diameter bounds via circuit imbalances	4
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization	4
Short-step methods are not strongly polynomial-time	4
Exact solution of network flow models with strong relaxations	4
A new integer programming formulation of the graphical traveling salesman problem	4
On the maximal number of columns of a $$\Delta $$-modular integer matrix: bounds and computations	4
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds	4
Correction to: Idealness of k-wise intersecting families	4
Finding global minima via kernel approximations	4
Lower bounds for non-convex stochastic optimization	4
Correction: Efficient Kirszbraun extension with applications to regression	4
Smooth over-parameterized solvers for non-smooth structured optimization	4
Characterizing the universal rigidity of generic tensegrities	4
Disjunctive cuts in Mixed-Integer Conic Optimization	4
Intersecting and dense restrictions of clutters in polynomial time	4
Neighborhood persistency of the linear optimization relaxation of integer linear optimization	4
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs	4
Cutoff stability under distributional constraints with an application to summer internship matching	4
Lyapunov stability of the subgradient method with constant step size	4
Achieving consistency with cutting planes	4
An elementary approach to tight worst case complexity analysis of gradient based methods	4
An online convex optimization-based framework for convex bilevel optimization	4
The price of Anarchy in series-parallel network congestion games	4

Optimizing distortion riskmetrics with distributional uncertainty	4
A PTAS for the horizontal rectangle stabbing problem	4
A normal fan projection algorithm for low-rank optimization	4
Polynomial-time algorithms for multimarginal optimal transport problems with structure	3
The aggregation closure is polyhedral for packing and covering integer programs	3
Complexity of chordal conversion for sparse semidefinite programs with small treewidth	3
Sparse regression at scale: branch-and-bound rooted in first-order optimization	3
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles	3
Convex envelopes of bounded monomials on two-variable cones	3
A frequency-domain analysis of inexact gradient methods	3
Sparsity and proximity transference in integer programming	3
Convex hulls of monomial curves, and a sparse positivstellensatz	3
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling	3
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators	3
Empowering the configuration-IP: new PTAS results for scheduling with setup times	3
k-median: exact recovery in the extended stochastic ball model	3
New characterizations of strategy-proofness under single-peakedness	3
FISTA is an automatic geometrically optimized algorithm for strongly convex functions	3
Stackelberg pricing games with congestion effects	3
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis	3
Stabilization of capacitated matching games	3
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization	3
Scalable subspace methods for derivative-free nonlinear least-squares optimization	3
Principled analyses and design of first-order methods with inexact proximal operators	3
Distributional utility preference robust optimization models in multi-attribute decision making	3
Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs	3
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid	3
A globally convergent proximal Newton-type method in nonsmooth convex optimization	3
Computational aspects of relaxation complexity: possibilities and limitations	3
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems	3
Optimizing for strategy diversity in the design of video games	3
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems	3
A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints	3
Some primal-dual theory for subgradient methods for strongly convex optimization	3
Optimal item pricing in online combinatorial auctions	3
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming	3
Apportionment with parity constraints	3
The core of a transferable utility game as the solution to a public good market demand problem	3
Packing under convex quadratic constraints	3
Generalized Nash equilibrium problems with mixed-integer variables	3
Global optimization using random embeddings	3
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty	2
Single source unsplittable flows with arc-wise lower and upper bounds	2
Dyadic linear programming and extensions	2
Mean–semideviation–based distributionally robust learning with weakly convex losses: convergence rates and finite-sample guarantees	2
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022	2
Optimal gradient tracking for decentralized optimization	2
ALSO-X#: better convex approximations for distributionally robust chance constrained programs	2
State polynomials: positivity, optimization and nonlinear Bell inequalities	2
Multiplicative auction algorithm for approximate maximum weight bipartite matching	2
Adjustability in robust linear optimization	2
Graph coloring and semidefinite rank	2
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming	2
On the geometry of symmetry breaking inequalities	2
Adjustable robust nonlinear network design without controllable elements under load scenario uncertainties	2
Risk-neutral PDE-constrained generalized Nash equilibrium problems	2
Branch-and-bound for integer D-optimality with fast local search and variable-bound tightening	2
Correction to: A scaling algorithm for optimizing arbitrary functions over vertices of polytopes	2
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians	2
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles	2
Solving nonconvex optimization problems using outer approximations of the set-copositive cone	2
Computing the nucleolus of weighted voting games in pseudo-polynomial time	2
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation	2
Preface	2
FPT algorithms for a special block-structured integer program with applications in scheduling	2
Homogenization of SGD in high-dimensions: exact dynamics and generalization properties	2
Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions	2
From differential equation solvers to accelerated first-order methods for convex optimization	2
Convergence in distribution of randomized algorithms: the case of partially separable optimization	2
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm	2
Fast convergence to non-isolated minima: four equivalent conditions for $${\textrm{C}^{2}}$$ functions	2
McCormick envelopes in mixed-integer PDE-constrained optimization	2
Publisher Correction to: A new perspective on low-rank optimization	2
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem	2
Special Issue: Hierarchical Optimization	2
A pessimistic bilevel stochastic problem for elastic shape optimization	2
Correction to: A sequential homotopy method for mathematical programming problems	2
Information complexity of mixed-integer convex optimization	2
Faster first-order primal-dual methods for linear programming using restarts and sharpness	2
Optimizing over path-length matrices of unrooted binary trees	2
Truthful ownership transfer with expert advice	2
On the geometric analysis of a quartic–quadratic optimization problem under a spherical constraint	2
Discrete potential mean field games: duality and numerical resolution	2
Online combinatorial assignment in independence systems	2
Correction to: Stronger MIP formulations for the Steiner forest problem	2
Robust convex optimization: A new perspective that unifies and extends	2
Efficient joint object matching via linear programming	2
Graphs with $$G^p$$-connected medians	2
Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-time	2
Non-convex exact community recovery in stochastic block model	2
Terracini convexity	2
Convergence rates for sums-of-squares hierarchies with correlative sparsity	2
Pareto Adaptive Robust Optimality via a Fourier–Motzkin Elimination lens	2
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification	2
Branch-and-bound solves random binary IPs in poly(n)-time	2