OOIR: Observatory of International Research

Papers

(The TQCC of Mathematical Programming is 5. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-11-01 to 2025-11-01.)

Article	Citations
Efficient separation of RLT cuts for implicit and explicit bilinear terms	45
Towards an optimal contention resolution scheme for matchings	35
A characterization of maximal homogeneous-quadratic-free sets	32
Optimal methods for convex nested stochastic composite optimization	30
Structural iterative rounding for generalized k-median problems	28
On the integrality gap of binary integer programs with Gaussian data	25
Multiplicative updates for symmetric-cone factorizations	25
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	25
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	25
Affinely representable lattices, stable matchings, and choice functions	24
A $$\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs	23
On the robustness of potential-based flow networks	22
A projection-free method for solving convex bilevel optimization problems	22
$$\mathcal {V}$$-polyhedral disjunctive cuts	21
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings	21
The exact worst-case convergence rate of the alternating direction method of multipliers	21
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations	20
Primal methods for variational inequality problems with functional constraints	19
Polyhedral Newton-min algorithms for complementarity problems	18
Weak notions of nondegeneracy in nonlinear semidefinite programming	18
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations	17
Fixed parameter approximation scheme for min-max k-cut	17
A new perspective on low-rank optimization	17
Preference ambiguity and robustness in multistage decision making	17
Stochastic algorithms with geometric step decay converge linearly on sharp functions	17

Sum-of-squares relaxations for polynomial min–max problems over simple sets	16
Shapes and recession cones in mixed-integer convex representability	16
Correction to: The ancestral Benders’ cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming	16
Subgradient ellipsoid method for nonsmooth convex problems	16
Correction to: Equilibrium computation in resource allocation games	15
A cutting-plane and benders’ decomposition algorithm for two-stage distributionally robust convex programs	15
The computational complexity of finding stationary points in non-convex optimization	15
Constrained optimization of rank-one functions with indicator variables	15
A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem	15
Nonlinear acceleration of momentum and primal-dual algorithms	15
A minimal face constant rank constraint qualification for reducible conic programming	15
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs	15
Tropical medians by transportation	15
Sequence independent lifting for a set of submodular maximization problems	14
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization	14
Decomposition of probability marginals for security games in max-flow/min-cut systems	14
Homogeneous second-order descent framework: a fast alternative to Newton-type methods	14
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity	14
On the optimality of pseudo-polynomial algorithms for integer programming	14
A linear time algorithm for linearizing quadratic and higher-order shortest path problems	13
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs	13
Exact computation of an error bound for the balanced linear complementarity problem with unique solution	13
A trust region method for noisy unconstrained optimization	13
A simple and fast linear-time algorithm for divisor methods of apportionment	12
How many matchings cover the nodes of a graph?	12
Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation	12
Solving sparse principal component analysis with global support	12
Special Issue: International Symposium on Mathematical Programming 2022	12
The effect of smooth parametrizations on nonconvex optimization landscapes	12
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso	11
Relaxations and duality for multiobjective integer programming	11
Accelerated first-order methods for a class of semidefinite programs	11
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems	11
Approximating the discrete time-cost tradeoff problem with bounded depth	10
Identifying optimal strategies in kidney exchange games is $$\varSigma _2^p$$-complete	10
On the resolution of cross-liabilities	10
Faster margin maximization rates for generic and adversarially robust optimization methods	10
A zonogon approach for computing small convex polygons of maximum perimeter	9
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization	9
A continuous approximation model for the electric vehicle fleet sizing problem	9
Unifying mirror descent and dual averaging	9
Inapproximability of shortest paths on perfect matching polytopes	9
A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction	8
The computation of pairwise stable networks	8
Low-rank mirror-prox methods for nonsmooth and low-rank matrix optimization problems	8
On the complexity of finding a local minimizer of a quadratic function over a polytope	8
On the stationarity for nonlinear optimization problems with polyhedral constraints	8
Machine learning augmented branch and bound for mixed integer linear programming	8
Inexact subgradient methods for semialgebraic functions	8
Fast Combinatorial Algorithms for Efficient Sortation	8

Low-rank optimization on Tucker tensor varieties	8
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier	8
Integer points in arbitrary convex cones: the case of the PSD and SOC cones	8
New lower bounds on crossing numbers of $$K_{m,n}$$ from semidefinite programming	8
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours	8
Quantifying low rank approximations of third order symmetric tensors	7
Fairness over time in dynamic resource allocation with an application in healthcare	7
Arboricity games: the core and the nucleolus	7
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles	7
Geometry of vectorial martingale optimal transportations and duality	7
Cut-sufficient directed 2-commodity multiflow topologies	7
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints	7
$$\mathbf {2\times 2}$$-Convexifications for convex quadratic optimization with indicator variables	7
The maximin support method: an extension of the D’Hondt method to approval-based multiwinner elections	7
Hyperbolicity cones are amenable	7
Implications, conflicts, and reductions for Steiner trees	7
Zeroth-order optimization with orthogonal random directions	7
A finite characterization of perfect equilibria	7
A gradient sampling algorithm for stratified maps with applications to topological data analysis	7
Online bipartite matching in the probe-commit model	7
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs	6
Capacitated facility location with outliers and uniform facility costs	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
The two-stripe symmetric circulant TSP is in P	6
Swarm gradient dynamics for global optimization: the mean-field limit case	6
On the directional asymptotic approach in optimization theory	6
A convergence analysis of the price of anarchy in atomic congestion games	6
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size	6
Multicriteria cuts and size-constrained k-cuts in hypergraphs	6
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems	6
Simple and fast algorithm for binary integer and online linear programming	6
Complexity of branch-and-bound and cutting planes in mixed-integer optimization	6
The mixed integer trust region problem	6
Stochastic Bregman Proximal Gradient Method Revisited: Kernel Conditioning and Painless Variance Reduction	6
On the strength of Burer’s lifted convex relaxation to quadratic programming with ball constraints	6
Non-asymptotic global convergence rates of BFGS with exact line search	6
Learning and decision-making with data : optimal formulations and phase transitions	6
Lipschitz minimization and the Goldstein modulus	6
Advances on strictly $$\Delta $$-modular IPs	6
An abstract model for branch and cut	6
Affine-invariant contracting-point methods for Convex Optimization	6
Matrix discrepancy and the log-rank conjecture	6
A graph-based decomposition method for convex quadratic optimization with indicators	6
Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis	6
Vertex downgrading to minimize connectivity	6
Non-convex nested Benders decomposition	5
Lyapunov stability of the subgradient method with constant step size	5
Phragmén’s voting methods and justified representation	5
Gradient regularization of Newton method with Bregman distances	5
Chance-constrained set covering with Wasserstein ambiguity	5
Level constrained first order methods for function constrained optimization	5
Graphical designs and gale duality	5
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	5
Assortment optimization with visibility constraints	5
Total dual dyadicness and dyadic generating sets	5
Cutoff stability under distributional constraints with an application to summer internship matching	5
Finding global minima via kernel approximations	5
The density of planar sets avoiding unit distances	5
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints	5
Resolvent splitting for sums of monotone operators with minimal lifting	5
Achieving consistency with cutting planes	5
On circuit diameter bounds via circuit imbalances	5
Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of Newton Method	5
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds	5
Correction to: Idealness of k-wise intersecting families	5
Sublinear circuits and the constrained signomial nonnegativity problem	5
Error bounds, facial residual functions and applications to the exponential cone	5
A parametric approach for solving convex quadratic optimization with indicators over trees	5