Mathematical Programming

Article	Citations
On implicit function theorem for locally Lipschitz equations	48
A competitive algorithm for throughput maximization on identical machines	29
Optimal item pricing in online combinatorial auctions	28
Special Issue: Topics in Stochastic Programming	25
k-median: exact recovery in the extended stochastic ball model	23
Simple and fast algorithm for binary integer and online linear programming	22
Sparse optimization on measures with over-parameterized gradient descent	20
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization	19
Riemannian proximal gradient methods	17
Optimal crashing of an activity network with disruptions	17
Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems	16
A characterization of maximal homogeneous-quadratic-free sets	16
Structural iterative rounding for generalized k-median problems	16
An $$O(s^r)$$-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems	16
A primal nonsmooth reformulation for bilevel optimization problems	16
K-adaptability in stochastic optimization	15
Efficient separation of RLT cuts for implicit and explicit bilinear terms	15
Parallel random block-coordinate forward–backward algorithm: a unified convergence analysis	14
Note on axiomatic properties of apportionment methods for proportional representation systems	14
Affine-invariant contracting-point methods for Convex Optimization	14
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings	14
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	14
A graph-based decomposition method for convex quadratic optimization with indicators	14
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization	14
A duality based 2-approximation algorithm for maximum agreement forest	13

On the integrality gap of binary integer programs with Gaussian data	13
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization	12
Affinely representable lattices, stable matchings, and choice functions	12
The mixed integer trust region problem	12
On the robustness of potential-based flow networks	12
Asymmetry in the complexity of the multi-commodity network pricing problem	11
Beyond symmetry: best submatrix selection for the sparse truncated SVD	11
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians	11
Newton acceleration on manifolds identified by proximal gradient methods	10
A polynomial time algorithm for finding a minimum 4-partition of a submodular function	10
Multiplicative updates for symmetric-cone factorizations	10
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles	10
Worst-case analysis of clique MIPs	10
Principled analyses and design of first-order methods with inexact proximal operators	10
Global stability of first-order methods for coercive tame functions	10
Apportionment with parity constraints	9
An active-set algorithm for norm constrained quadratic problems	9
No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization	9
Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality	9
On the sensitivity of the optimal partition for parametric second-order conic optimization	9
A finite characterization of perfect equilibria	9
On the convex hull of convex quadratic optimization problems with indicators	9
Optimal methods for convex nested stochastic composite optimization	9
Data perturbations in stochastic generalized equations: statistical robustness in static and sample average approximated models	9
Bootstrap robust prescriptive analytics	9
The core of a transferable utility game as the solution to a public good market demand problem	9
A novel reformulation for the single-sink fixed-charge transportation problem	9
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators	9
Monoidal strengthening and unique lifting in MIQCPs	8
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints	8
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity	8
A control-theoretic perspective on optimal high-order optimization	8
Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling	8
Complexity of branch-and-bound and cutting planes in mixed-integer optimization	8
Sparse representation of vectors in lattices and semigroups	8
Optimization on flag manifolds	8
Approximate and strategyproof maximin share allocation of chores with ordinal preferences	8
Accelerated proximal point method for maximally monotone operators	7
A Lagrange–Newton algorithm for sparse nonlinear programming	7
On the strength of Lagrangian duality in multiobjective integer programming	7
A frequency-domain analysis of inexact gradient methods	7
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	7
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations	7
Accelerated-gradient-based generalized Levenberg–Marquardt method with oracle complexity bound and local quadratic convergence	7
Understanding the acceleration phenomenon via high-resolution differential equations	7
The exact worst-case convergence rate of the alternating direction method of multipliers	7
Swarm gradient dynamics for global optimization: the mean-field limit case	7
Empowering the configuration-IP: new PTAS results for scheduling with setup times	7
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization	7
Cuts and semidefinite liftings for the complex cut polytope	7

A projection-free method for solving convex bilevel optimization problems	7
Matroid bases with cardinality constraints on the intersection	7
The price of anarchy in routing games as a function of the demand	7
Riemannian trust-region methods for strict saddle functions with complexity guarantees	7
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection	7
Revisiting augmented Lagrangian duals	7
Polyhedral aspects of feedback vertex set and pseudoforest deletion set	7
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship	6
Mean robust optimization	6
Equilibrium computation in resource allocation games	6
Convex hulls of monomial curves, and a sparse positivstellensatz	6
Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems	6
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens	6
The maximum measure of non-trivial 3-wise intersecting families	6
Matrix discrepancy and the log-rank conjecture	6
Towards an optimal contention resolution scheme for matchings	6
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid	6
Popular branchings and their dual certificates	6
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020	6
Shapes and recession cones in mixed-integer convex representability	6
Generalized Nash equilibrium problems with mixed-integer variables	6
A slope generalization of Attouch theorem	6
Perseus: a simple and optimal high-order method for variational inequalities	6
Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization	6
Non-convex exact community recovery in stochastic block model	6
Correction to: Equilibrium computation in resource allocation games	5
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators	5
Speed-robust scheduling: sand, bricks, and rocks	5
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	5
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints	5
Continuous facility location on graphs	5
Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses	5
Convexification techniques for fractional programs	5
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations	5
Semi-streaming algorithms for submodular matroid intersection	5
A new perspective on low-rank optimization	5
Softmax policy gradient methods can take exponential time to converge	5
Vertex downgrading to minimize connectivity	5
Splitting games over finite sets	5
Sparse PCA on fixed-rank matrices	5
Modeling combinatorial disjunctive constraints via junction trees	5
Stochastic first-order methods for convex and nonconvex functional constrained optimization	5
Online k-taxi via Double Coverage and time-reverse primal-dual	5
Special Issue: Polynomial and Tensor Optimization	5
Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	5
Submodular maximization and its generalization through an intersection cut lens	5
Utility/privacy trade-off as regularized optimal transport	5
A convergence analysis of the price of anarchy in atomic congestion games	5
Absorption paths and equilibria in quitting games	5
Chance-constrained set covering with Wasserstein ambiguity	4
Fixed parameter approximation scheme for min-max k-cut	4
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations	4
Level constrained first order methods for function constrained optimization	4
Convergence rates for sums-of-squares hierarchies with correlative sparsity	4
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration	4
Stackelberg risk preference design	4
A new extension of Chubanov’s method to symmetric cones	4
Approximation algorithms for flexible graph connectivity	4
Weak notions of nondegeneracy in nonlinear semidefinite programming	4
A pessimistic bilevel stochastic problem for elastic shape optimization	4
On the directional asymptotic approach in optimization theory	4
Hessian barrier algorithms for non-convex conic optimization	4
Efficient Kirszbraun extension with applications to regression	4
Information complexity of mixed-integer convex optimization	4
Perturbed Fenchel duality and first-order methods	4
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization	4
Stochastic makespan minimization in structured set systems	4
Sum-of-squares relaxations for polynomial min–max problems over simple sets	4
Generalized minimum 0-extension problem and discrete convexity	4
Nonlinear acceleration of momentum and primal-dual algorithms	4
McCormick envelopes in mixed-integer PDE-constrained optimization	4
Radial duality part II: applications and algorithms	4
The simultaneous semi-random model for TSP	3
Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs	3
Scalable adaptive cubic regularization methods	3
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification	3
Convex hull results on quadratic programs with non-intersecting constraints	3
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size	3
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs	3
Graphical designs and gale duality	3

A unified framework for symmetry handling	3
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming	3
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs	3
Sublinear circuits and the constrained signomial nonnegativity problem	3
Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry	3
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021	3
An abstract model for branch and cut	3
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem	3
Semidefinite programming hierarchies for constrained bilinear optimization	3
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty	3
Non-convex nested Benders decomposition	3
On lower iteration complexity bounds for the convex concave saddle point problems	3
Graph coloring with decision diagrams	3
An optimal gradient method for smooth strongly convex minimization	3
Configuration balancing for stochastic requests	3
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems	3
Tropical medians by transportation	3
The complexity of first-order optimization methods from a metric perspective	3
Complexity of a projected Newton-CG method for optimization with bounds	3
A 2-approximation for the bounded treewidth sparsest cut problem in $$\textsf{FPT}$$ Time	3
Multicriteria cuts and size-constrained k-cuts in hypergraphs	3
Error bounds, facial residual functions and applications to the exponential cone	3
Stochastic algorithms with geometric step decay converge linearly on sharp functions	3
On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy	3
Advances on strictly $$\Delta $$-modular IPs	3
Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations	3
Subgradient ellipsoid method for nonsmooth convex problems	3
Generalized scaling for the constrained maximum-entropy sampling problem	3
Constrained optimization of rank-one functions with indicator variables	3
Resolvent splitting for sums of monotone operators with minimal lifting	3
The density of planar sets avoiding unit distances	3
Rates of superlinear convergence for classical quasi-Newton methods	2
A framework for generalized Benders’ decomposition and its application to multilevel optimization	2
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient	2
Consistent approximations in composite optimization	2
Positivity certificates and polynomial optimization on non-compact semialgebraic sets	2
Homogenization for polynomial optimization with unbounded sets	2
A fast $$(2 + \frac{2}{7})$$-approximation algorithm for capacitated cycle covering	2
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods	2
Decomposition of probability marginals for security games in max-flow/min-cut systems	2
Fully polynomial time $$(\Sigma ,\Pi )$$-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs	2
Outer approximation for global optimization of mixed-integer quadratic bilevel problems	2
Best approximation mappings in Hilbert spaces	2
Gradient regularization of Newton method with Bregman distances	2
A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization	2
State polynomials: positivity, optimization and nonlinear Bell inequalities	2
Phragmén’s voting methods and justified representation	2
Convergence rates of the Heavy-Ball method under the Łojasiewicz property	2
About the complexity of two-stage stochastic IPs	2
Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices	2
Radial duality part I: foundations	2
Convex generalized Nash equilibrium problems and polynomial optimization	2
Stable set polytopes with high lift-and-project ranks for the Lovász–Schrijver SDP operator	2
Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization	2
Neural networks with linear threshold activations: structure and algorithms	2
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians	2
An augmented Lagrangian method for optimization problems with structured geometric constraints	2
Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse	2
Correction to: The ancestral Benders’ cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming	2
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs	2
Hessian averaging in stochastic Newton methods achieves superlinear convergence	2
The computational complexity of finding stationary points in non-convex optimization	2
On the geometric analysis of a quartic–quadratic optimization problem under a spherical constraint	2
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization	2
Monoidal strengthening of simple $$\mathcal {V}$$-polyhedral disjunctive cuts	2
Approximation algorithms for the generalized incremental knapsack problem	2
Fair division of graphs and of tangled cakes	2
Recognizing even-cycle and even-cut matroids	2
Achieving consistency with cutting planes	2
Recognizing pinch-graphic matroids	2
A trust region method for noisy unconstrained optimization	2
Robust convex optimization: A new perspective that unifies and extends	2
Sequence independent lifting for a set of submodular maximization problems	2
On the effective Putinar’s Positivstellensatz and moment approximation	2
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization	2
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski	2
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs	2
Adversarial classification via distributional robustness with Wasserstein ambiguity	2
From differential equation solvers to accelerated first-order methods for convex optimization	2
Two-halfspace closure	2
Distributionally robust stochastic programs with side information based on trimmings	2
Complexity of optimizing over the integers	2
Sum of squares generalizations for conic sets	2
Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints	2
Exact computation of an error bound for the balanced linear complementarity problem with unique solution	2
Graphs with $$G^p$$-connected medians	2
Adaptive Sampling line search for local stochastic optimization with integer variables	2
Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates	2
A unified stochastic approximation framework for learning in games	2
A combinatorial algorithm for computing the rank of a generic partitioned matrix with $$2 \times 2$$ submatrices	2
Probability maximization via Minkowski functionals: convex representations and tractable resolution	2
Set characterizations and convex extensions for geometric convex-hull proofs	2
Linear-step solvability of some folded concave and singly-parametric sparse optimization problems	2
Why webster?	2
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation	2