Mathematical Programming

Article	Citations
Efficient separation of RLT cuts for implicit and explicit bilinear terms	37
Towards an optimal contention resolution scheme for matchings	33
On the integrality gap of binary integer programs with Gaussian data	30
A characterization of maximal homogeneous-quadratic-free sets	30
A projection-free method for solving convex bilevel optimization problems	30
The exact worst-case convergence rate of the alternating direction method of multipliers	27
Multiplicative updates for symmetric-cone factorizations	26
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings	23
Optimal methods for convex nested stochastic composite optimization	22
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	22
Structural iterative rounding for generalized k-median problems	21
On the robustness of potential-based flow networks	20
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	20
Affinely representable lattices, stable matchings, and choice functions	19
$$\mathcal {V}$$-polyhedral disjunctive cuts	19
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations	18
A $$\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs	18
Preference ambiguity and robustness in multistage decision making	17
Nonlinear acceleration of momentum and primal-dual algorithms	17
Shapes and recession cones in mixed-integer convex representability	16
Sum-of-squares relaxations for polynomial min–max problems over simple sets	16
Fixed parameter approximation scheme for min-max k-cut	16
Tropical medians by transportation	16
Subgradient ellipsoid method for nonsmooth convex problems	16
A new perspective on low-rank optimization	15

Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations	15
Correction to: The ancestral Benders’ cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming	15
Constrained optimization of rank-one functions with indicator variables	15
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs	14
Weak notions of nondegeneracy in nonlinear semidefinite programming	14
A linear time algorithm for linearizing quadratic and higher-order shortest path problems	14
Primal methods for variational inequality problems with functional constraints	14
A minimal face constant rank constraint qualification for reducible conic programming	14
A trust region method for noisy unconstrained optimization	14
Stochastic algorithms with geometric step decay converge linearly on sharp functions	14
Correction to: Equilibrium computation in resource allocation games	14
Polyhedral Newton-min algorithms for complementarity problems	14
A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem	14
Decomposition of probability marginals for security games in max-flow/min-cut systems	13
Discrete 2-convex functions	13
The computational complexity of finding stationary points in non-convex optimization	13
On the optimality of pseudo-polynomial algorithms for integer programming	13
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity	13
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization	13
Sequence independent lifting for a set of submodular maximization problems	13
Identifying optimal strategies in kidney exchange games is $$\varSigma _2^p$$-complete	12
Exact computation of an error bound for the balanced linear complementarity problem with unique solution	12
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs	12
Homogeneous second-order descent framework: a fast alternative to Newton-type methods	12
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems	12
Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation	11
A simple and fast linear-time algorithm for divisor methods of apportionment	11
Special Issue: International Symposium on Mathematical Programming 2022	11
Accelerated first-order methods for a class of semidefinite programs	11
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso	10
Solving sparse principal component analysis with global support	10
Decreasing minimization on M-convex sets: algorithms and applications	10
How many matchings cover the nodes of a graph?	10
The effect of smooth parametrizations on nonconvex optimization landscapes	10
Relaxations and duality for multiobjective integer programming	9
Approximating the discrete time-cost tradeoff problem with bounded depth	9
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization	9
On the resolution of cross-liabilities	9
Decreasing minimization on M-convex sets: background and structures	9
Unifying mirror descent and dual averaging	9
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
A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction	9
Integer points in arbitrary convex cones: the case of the PSD and SOC cones	8
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours	8
Machine learning augmented branch and bound for mixed integer linear programming	8
Inapproximability of shortest paths on perfect matching polytopes	8
Arboricity games: the core and the nucleolus	7
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints	7
The computation of pairwise stable networks	7

On the stationarity for nonlinear optimization problems with polyhedral constraints	7
Inexact subgradient methods for semialgebraic functions	7
A gradient sampling algorithm for stratified maps with applications to topological data analysis	7
Quantifying low rank approximations of third order symmetric tensors	7
$$\mathbf {2\times 2}$$-Convexifications for convex quadratic optimization with indicator variables	7
Geometry of vectorial martingale optimal transportations and duality	7
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier	7
Low-rank optimization on Tucker tensor varieties	7
A zonogon approach for computing small convex polygons of maximum perimeter	7
Online bipartite matching in the probe-commit model	7
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles	7
The maximin support method: an extension of the D’Hondt method to approval-based multiwinner elections	7
On the complexity of finding a local minimizer of a quadratic function over a polytope	7
Cut-sufficient directed 2-commodity multiflow topologies	7
Hyperbolicity cones are amenable	7
Revisiting augmented Lagrangian duals	6
Affine-invariant contracting-point methods for Convex Optimization	6
A graph-based decomposition method for convex quadratic optimization with indicators	6
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization	6
The mixed integer trust region problem	6
Fairness over time in dynamic resource allocation with an application in healthcare	6
A novel reformulation for the single-sink fixed-charge transportation problem	6
The two-stripe symmetric circulant TSP is in P	6
Simple and fast algorithm for binary integer and online linear programming	6
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization	6
Zeroth-order optimization with orthogonal random directions	6
A finite characterization of perfect equilibria	6
Matrix discrepancy and the log-rank conjecture	6
Swarm gradient dynamics for global optimization: the mean-field limit case	6
Complexity of branch-and-bound and cutting planes in mixed-integer optimization	6
Implications, conflicts, and reductions for Steiner trees	6
A convergence analysis of the price of anarchy in atomic congestion games	5
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints	5
Vertex downgrading to minimize connectivity	5
Level constrained first order methods for function constrained optimization	5
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems	5
Gradient regularization of Newton method with Bregman distances	5
On circuit diameter bounds via circuit imbalances	5
Correction to: Idealness of k-wise intersecting families	5
Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis	5
Graphical designs and gale duality	5
Sublinear circuits and the constrained signomial nonnegativity problem	5
The density of planar sets avoiding unit distances	5
Multicriteria cuts and size-constrained k-cuts in hypergraphs	5
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs	5
Advances on strictly $$\Delta $$-modular IPs	5
Lyapunov stability of the subgradient method with constant step size	5
Achieving consistency with cutting planes	5
Lipschitz minimization and the Goldstein modulus	5
Non-convex nested Benders decomposition	5
A parametric approach for solving convex quadratic optimization with indicators over trees	5
Error bounds, facial residual functions and applications to the exponential cone	5
On the directional asymptotic approach in optimization theory	5
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size	5
An abstract model for branch and cut	5
Chance-constrained set covering with Wasserstein ambiguity	5
Finding global minima via kernel approximations	5
Total dual dyadicness and dyadic generating sets	5
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	5
Resolvent splitting for sums of monotone operators with minimal lifting	5
Phragmén’s voting methods and justified representation	4
Intersecting and dense restrictions of clutters in polynomial time	4
Lower bounds for non-convex stochastic optimization	4
Assortment optimization with visibility constraints	4
Correction: Efficient Kirszbraun extension with applications to regression	4
Optimizing distortion riskmetrics with distributional uncertainty	4
An online convex optimization-based framework for convex bilevel optimization	4
Exact solution of network flow models with strong relaxations	4
Scalable subspace methods for derivative-free nonlinear least-squares optimization	4
A characterization for tightness of the sparse Moment-SOS hierarchy	4
A new integer programming formulation of the graphical traveling salesman problem	4
Smooth over-parameterized solvers for non-smooth structured optimization	4
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization	4
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds	4
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs	4
Neighborhood persistency of the linear optimization relaxation of integer linear optimization	4
Computational aspects of relaxation complexity: possibilities and limitations	4
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming	4
Sharper exponential convergence rates for Sinkhorn’s algorithm in continuous settings	4
The price of Anarchy in series-parallel network congestion games	4

Optimizing for strategy diversity in the design of video games	4
A normal fan projection algorithm for low-rank optimization	4
On the maximal number of columns of a $$\Delta $$-modular integer matrix: bounds and computations	4
Cutoff stability under distributional constraints with an application to summer internship matching	4
About the complexity of two-stage stochastic IPs	4
A PTAS for the horizontal rectangle stabbing problem	4
Short-step methods are not strongly polynomial-time	4
Some primal-dual theory for subgradient methods for strongly convex optimization	4
Disjunctive cuts in Mixed-Integer Conic Optimization	4
Characterizing the universal rigidity of generic tensegrities	4
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems	4
An elementary approach to tight worst case complexity analysis of gradient based methods	4
Convex envelopes of bounded monomials on two-variable cones	4