Mathematical Programming

Article	Citations
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling	63
A characterization of maximal homogeneous-quadratic-free sets	29
Efficient separation of RLT cuts for implicit and explicit bilinear terms	27
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid	27
Monoidal strengthening and unique lifting in MIQCPs	27
Towards an optimal contention resolution scheme for matchings	22
Special Issue: Topics in Stochastic Programming	20
Complexity of branch-and-bound and cutting planes in mixed-integer optimization	19
Simple and fast algorithm for binary integer and online linear programming	19
A frequency-domain analysis of inexact gradient methods	18
Affinely representable lattices, stable matchings, and choice functions	18
Distributionally Risk-Receptive and Robust Multistage Stochastic Integer Programs and Interdiction Models	18
Optimization on flag manifolds	18
Polyhedral aspects of feedback vertex set and pseudoforest deletion set	18
No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization	17
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators	17
Multiplicative updates for symmetric-cone factorizations	17
A control-theoretic perspective on optimal high-order optimization	16
k-median: exact recovery in the extended stochastic ball model	16
A novel reformulation for the single-sink fixed-charge transportation problem	16
Bootstrap robust prescriptive analytics	16
The exact worst-case convergence rate of the alternating direction method of multipliers	15
Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems	15
Asymmetry in the complexity of the multi-commodity network pricing problem	15
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians	15

Worst-case analysis of clique MIPs	15
The core of a transferable utility game as the solution to a public good market demand problem	14
A primal nonsmooth reformulation for bilevel optimization problems	14
Perseus: a simple and optimal high-order method for variational inequalities	14
Data perturbations in stochastic generalized equations: statistical robustness in static and sample average approximated models	13
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization	13
Sparse representation of vectors in lattices and semigroups	13
K-adaptability in stochastic optimization	13
On the integrality gap of binary integer programs with Gaussian data	12
A Lagrange–Newton algorithm for sparse nonlinear programming	12
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization	12
On the robustness of potential-based flow networks	12
Parallel random block-coordinate forward–backward algorithm: a unified convergence analysis	12
Affine-invariant contracting-point methods for Convex Optimization	12
On the strength of Lagrangian duality in multiobjective integer programming	11
Revisiting augmented Lagrangian duals	11
On the sensitivity of the optimal partition for parametric second-order conic optimization	11
Optimal methods for convex nested stochastic composite optimization	11
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	11
A competitive algorithm for throughput maximization on identical machines	11
The price of anarchy in routing games as a function of the demand	11
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization	10
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	10
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints	10
On implicit function theorem for locally Lipschitz equations	10
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings	10
Global stability of first-order methods for coercive tame functions	10
Approximate and strategyproof maximin share allocation of chores with ordinal preferences	9
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations	9
Cuts and semidefinite liftings for the complex cut polytope	9
A finite characterization of perfect equilibria	9
Swarm gradient dynamics for global optimization: the mean-field limit case	9
Mean robust optimization	9
Optimal crashing of an activity network with disruptions	9
A duality based 2-approximation algorithm for maximum agreement forest	9
Structural iterative rounding for generalized k-median problems	9
Optimal item pricing in online combinatorial auctions	9
A polynomial time algorithm for finding a minimum 4-partition of a submodular function	9
Matrix discrepancy and the log-rank conjecture	8
The mixed integer trust region problem	8
A projection-free method for solving convex bilevel optimization problems	8
On the convex hull of convex quadratic optimization problems with indicators	8
Riemannian trust-region methods for strict saddle functions with complexity guarantees	8
Beyond symmetry: best submatrix selection for the sparse truncated SVD	8
A slope generalization of Attouch theorem	8
Accelerated-gradient-based generalized Levenberg–Marquardt method with oracle complexity bound and local quadratic convergence	8
An $$O(s^r)$$-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems	8
Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality	7
Principled analyses and design of first-order methods with inexact proximal operators	7
Note on axiomatic properties of apportionment methods for proportional representation systems	7

First- and second-order high probability complexity bounds for trust-region methods with noisy oracles	7
Apportionment with parity constraints	7
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization	7
Convex hulls of monomial curves, and a sparse positivstellensatz	7
Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization	7
A graph-based decomposition method for convex quadratic optimization with indicators	7
Empowering the configuration-IP: new PTAS results for scheduling with setup times	7
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection	7
Newton acceleration on manifolds identified by proximal gradient methods	7
Understanding the acceleration phenomenon via high-resolution differential equations	7
Generalized Nash equilibrium problems with mixed-integer variables	7
Branch-and-bound for integer D-optimality with fast local search and variable-bound tightening	7
McCormick envelopes in mixed-integer PDE-constrained optimization	6
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization	6
Special Issue: Polynomial and Tensor Optimization	6
Online k-taxi via Double Coverage and time-reverse primal-dual	6
Perturbed Fenchel duality and first-order methods	6
Solving nonconvex optimization problems using outer approximations of the set-copositive cone	6
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021	6
Semi-streaming algorithms for submodular matroid intersection	6
On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy	6
Primal methods for variational inequality problems with functional constraints	6
Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs	6
On lower iteration complexity bounds for the convex concave saddle point problems	5
Absorption paths and equilibria in quitting games	5
Multicriteria cuts and size-constrained k-cuts in hypergraphs	5
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians	5
Fixed parameter approximation scheme for min-max k-cut	5
Modeling combinatorial disjunctive constraints via junction trees	5
Convexification techniques for fractional programs	5
The complexity of first-order optimization methods from a metric perspective	5
Vertex downgrading to minimize connectivity	5
Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry	5
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods	5
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming	5
Non-convex exact community recovery in stochastic block model	5
A convergence analysis of the price of anarchy in atomic congestion games	5
Error bounds, facial residual functions and applications to the exponential cone	5
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs	5
Generalized minimum 0-extension problem and discrete convexity	5
Correction to: Equilibrium computation in resource allocation games	5
Popular branchings and their dual certificates	5
Radial duality part II: applications and algorithms	5
Nonlinear acceleration of momentum and primal-dual algorithms	5
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints	5
Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems	5
Efficient Kirszbraun extension with applications to regression	5
Tropical medians by transportation	5
Graphical designs and gale duality	5
Sublinear circuits and the constrained signomial nonnegativity problem	5
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size	4
Softmax policy gradient methods can take exponential time to converge	4
Approximation algorithms for flexible graph connectivity	4
Complexity of a projected Newton-CG method for optimization with bounds	4
Submodular maximization and its generalization through an intersection cut lens	4
Scalable adaptive cubic regularization methods	4
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs	4
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems	4
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations	4
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem	4
An abstract model for branch and cut	4
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification	4
Chance-constrained set covering with Wasserstein ambiguity	4
Constrained optimization of rank-one functions with indicator variables	4
Sum-of-squares relaxations for polynomial min–max problems over simple sets	4
Hessian barrier algorithms for non-convex conic optimization	4
A unified framework for symmetry handling	4
Generalized scaling for the constrained maximum-entropy sampling problem	4
The density of planar sets avoiding unit distances	4
Stochastic algorithms with geometric step decay converge linearly on sharp functions	4
Subgradient ellipsoid method for nonsmooth convex problems	4
Weak notions of nondegeneracy in nonlinear semidefinite programming	4
The maximum measure of non-trivial 3-wise intersecting families	4
A 2-approximation for the bounded treewidth sparsest cut problem in $$\textsf{FPT}$$ Time	4
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens	4
Utility/privacy trade-off as regularized optimal transport	4
Graph coloring with decision diagrams	4
Sparse PCA on fixed-rank matrices	4
On the directional asymptotic approach in optimization theory	4
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient	4

A new extension of Chubanov’s method to symmetric cones	4
Homogenization for polynomial optimization with unbounded sets	4
Partitioned matching games for international kidney exchange	3
Convergence of the preconditioned proximal point method and Douglas–Rachford splitting in the absence of monotonicity	3
Non-convex nested Benders decomposition	3
Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses	3
On penalty-based bilevel gradient descent method	3
Level constrained first order methods for function constrained optimization	3
Stackelberg risk preference design	3
Advances on strictly $$\Delta $$-modular IPs	3
Convergence rates for sums-of-squares hierarchies with correlative sparsity	3
Monoidal strengthening of simple $$\mathcal {V}$$-polyhedral disjunctive cuts	3
Convex hull results on quadratic programs with non-intersecting constraints	3
A pessimistic bilevel stochastic problem for elastic shape optimization	3
Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs	3
Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization	3
An accelerated distributed stochastic gradient method with momentum	3
An optimal gradient method for smooth strongly convex minimization	3
Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations	3
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	3
A new perspective on low-rank optimization	3
Correction to: The ancestral Benders’ cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming	3
Information complexity of mixed-integer convex optimization	3
Splitting games over finite sets	3
On the smallest support size of integer solutions to linear equations	3
Shapes and recession cones in mixed-integer convex representability	3
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators	3
The simultaneous semi-random model for TSP	3
Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis	3
Configuration balancing for stochastic requests	3
Speed-robust scheduling: sand, bricks, and rocks	3
Stochastic first-order methods for convex and nonconvex functional constrained optimization	3
Semidefinite programming hierarchies for constrained bilinear optimization	3
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations	3
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020	3
Adversarial classification via distributional robustness with Wasserstein ambiguity	3
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty	3
Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	3
Resolvent splitting for sums of monotone operators with minimal lifting	3
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship	3
Stochastic makespan minimization in structured set systems	3
Stable set polytopes with high lift-and-project ranks for the Lovász–Schrijver SDP operator	2
Distributionally robust stochastic variational inequalities	2
A linear time algorithm for linearizing quadratic and higher-order shortest path problems	2
Consistent approximations in composite optimization	2
Convex generalized Nash equilibrium problems and polynomial optimization	2
On the complexity of separating cutting planes for the knapsack polytope	2
Robust convex optimization: A new perspective that unifies and extends	2
Recognizing pinch-graphic matroids	2
On circuit diameter bounds via circuit imbalances	2
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs	2
Convergence rates of the Heavy-Ball method under the Łojasiewicz property	2
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm	2
Two-halfspace closure	2
Adaptive Sampling line search for local stochastic optimization with integer variables	2
Polarized consensus-based dynamics for optimization and sampling	2
Linear-step solvability of some folded concave and singly-parametric sparse optimization problems	2
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization	2
On linear optimization over Wasserstein balls	2
Probability maximization via Minkowski functionals: convex representations and tractable resolution	2
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization	2
Cutoff stability under distributional constraints with an application to summer internship matching	2
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming	2
Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates	2
Gradient regularization of Newton method with Bregman distances	2
Fair division of graphs and of tangled cakes	2
A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization	2
Sum of squares generalizations for conic sets	2
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation	2
A fast $$(2 + \frac{2}{7})$$-approximation algorithm for capacitated cycle covering	2
Neural networks with linear threshold activations: structure and algorithms	2
Why webster?	2
Achieving consistency with cutting planes	2
From differential equation solvers to accelerated first-order methods for convex optimization	2
The computational complexity of finding stationary points in non-convex optimization	2
A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems	2
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity	2
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k	2
A $$\frac{4}{3}$$-approximation algorithm for half-integral cycle cut instances of the TSP	2
Exact computation of an error bound for the balanced linear complementarity problem with unique solution	2
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski	2
An exact penalty approach for optimization with nonnegative orthogonality constraints	2
Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy	2
Graphs with $$G^p$$-connected medians	2
Complexity of optimizing over the integers	2
Radial duality part I: foundations	2
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs	2
From coordinate subspaces over finite fields to ideal multipartite uniform clutters	2
Correction: Global convergence of the gradient method for functions definable in o-minimal structures	2
Approximation algorithms for the generalized incremental knapsack problem	2
Deciding whether a lattice has an orthonormal basis is in co-NP	2
A combinatorial algorithm for computing the rank of a generic partitioned matrix with $$2 \times 2$$ submatrices	2
Set characterizations and convex extensions for geometric convex-hull proofs	2
Dyadic linear programming and extensions	2
First order asymptotics of the sample average approximation method to solve risk averse stochastic programs	2