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 2022-05-01 to 2026-05-01.)

Article	Citations
Towards an optimal contention resolution scheme for matchings	53
A characterization of maximal homogeneous-quadratic-free sets	37
Multiplicative updates for symmetric-cone factorizations	35
$$\mathcal {V}$$-polyhedral disjunctive cuts	32
On the integrality gap of binary integer programs with Gaussian data	31
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations	31
The exact worst-case convergence rate of the alternating direction method of multipliers	29
Efficient separation of RLT cuts for implicit and explicit bilinear terms	24
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians	24
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings	24
Affinely representable lattices, stable matchings, and choice functions	24
A projection-free method for solving convex bilevel optimization problems	24
Optimal methods for convex nested stochastic composite optimization	22
Structural iterative rounding for generalized k-median problems	21
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates	21
A $$\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs	20
Shapes and recession cones in mixed-integer convex representability	20
Primal methods for variational inequality problems with functional constraints	20
Weak notions of nondegeneracy in nonlinear semidefinite programming	19
Constrained optimization of rank-one functions with indicator variables	19
Sum-of-squares relaxations for polynomial min–max problems over simple sets	19
Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization	19
A cutting-plane and benders’ decomposition algorithm for two-stage distributionally robust convex programs	19
Stochastic algorithms with geometric step decay converge linearly on sharp functions	18
A minimal face constant rank constraint qualification for reducible conic programming	18

Subgradient ellipsoid method for nonsmooth convex problems	18
Polyhedral Newton-min algorithms for complementarity problems	18
Correction to: Equilibrium computation in resource allocation games	17
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs	16
Correction to: The ancestral Benders’ cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming	16
Fixed parameter approximation scheme for min-max k-cut	16
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations	15
Tropical medians by transportation	15
The computational complexity of finding stationary points in non-convex optimization	14
A new perspective on low-rank optimization	14
A linear time algorithm for linearizing quadratic and higher-order shortest path problems	14
Preference ambiguity and robustness in multistage decision making	14
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization	13
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity	13
Exact computation of an error bound for the balanced linear complementarity problem with unique solution	12
Homogeneous second-order descent framework: a fast alternative to Newton-type methods	12
Stochastic algorithms for large-scale composite optimization: the case of likelihood maximization for X-FEL imaging	12
A trust region method for noisy unconstrained optimization	12
Decomposition of probability marginals for security games in max-flow/min-cut systems	12
Getting to the root of the problem: sums of squares for limits of trees	12
A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem	12
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso	11
How many matchings cover the nodes of a graph?	11
Solving sparse principal component analysis with global support	11
Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation	11
Special Issue: International Symposium on Mathematical Programming 2022	11
On the resolution of cross-liabilities	11
Operator convexity along lines, self-concordance, and sandwiched Rényi entropies	10
The effect of smooth parametrizations on nonconvex optimization landscapes	10
Relaxations and duality for multiobjective integer programming	10
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems	10
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs	10
A simple and fast linear-time algorithm for divisor methods of apportionment	10
Accelerated first-order methods for a class of semidefinite programs	10
Faster margin maximization rates for generic and adversarially robust optimization methods	10
Low-rank optimization on Tucker tensor varieties	9
Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron	9
Low-rank mirror-prox methods for nonsmooth and low-rank matrix optimization problems	9
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier	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
New lower bounds on crossing numbers of $$K_{m,n}$$ from semidefinite programming	9
On the stationarity for nonlinear optimization problems with polyhedral constraints	9
Unifying mirror descent and dual averaging	9
On tractability, complexity, and mixed-integer convex programming representability of distributionally favorable optimization	9
A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron	9
A zonogon approach for computing small convex polygons of maximum perimeter	9
Inapproximability of shortest paths on perfect matching polytopes	8
Fast Combinatorial Algorithms for Efficient Sortation	8
Cut-sufficient directed 2-commodity multiflow topologies	8

A gradient sampling algorithm for stratified maps with applications to topological data analysis	8
A Hessian-aware stochastic differential equation for modelling SGD	8
Integer points in arbitrary convex cones: the case of the PSD and SOC cones	8
Geometry of vectorial martingale optimal transportations and duality	8
Online bipartite matching in the probe-commit model	8
Inexact subgradient methods for semialgebraic functions	8
Machine learning augmented branch and bound for mixed integer linear programming	8
Primal-dual proximal bundle and conditional gradient methods for convex problems	8
Zeroth-order optimization with orthogonal random directions	7
Fairness over time in dynamic resource allocation with an application in healthcare	7
On the partial convexification for low-rank spectral optimization: rank bounds and algorithms	7
A graph-based decomposition method for convex quadratic optimization with indicators	7
The two-stripe symmetric circulant TSP is in P	7
Stochastic Bregman Proximal Gradient Method Revisited: Kernel Conditioning and Painless Variance Reduction	7
$$\mathbf {2\times 2}$$-Convexifications for convex quadratic optimization with indicator variables	7
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization	7
The mixed integer trust region problem	7
Capacitated facility location with outliers and uniform facility costs	7
Swarm gradient dynamics for global optimization: the mean-field limit case	7
Matrix discrepancy and the log-rank conjecture	7
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles	7
Hyperbolicity cones are amenable	7
Efficient branching rules for optimizing range and order-based objective functions	7
Quantifying low rank approximations of third order symmetric tensors	7
A novel reformulation for the single-sink fixed-charge transportation problem	7
Simple and fast algorithm for binary integer and online linear programming	7
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints	6
Lipschitz minimization and the Goldstein modulus	6
On the strength of Burer’s lifted convex relaxation to quadratic programming with ball constraints	6
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems	6
The density of planar sets avoiding unit distances	6
A convergence analysis of the price of anarchy in atomic congestion games	6
Error bounds, facial residual functions and applications to the exponential cone	6
Vertex downgrading to minimize connectivity	6
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs	6
Advances on strictly $$\Delta $$-modular IPs	6
An abstract model for branch and cut	6
A Reliability Theory of Compromise Decisions for Large-Scale Stochastic Programs	6
Learning and decision-making with data : optimal formulations and phase transitions	6
Strongly-polynomial time and validation analysis of policy gradient methods	6
On the directional asymptotic approach in optimization theory	6
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods	6
Level constrained first order methods for function constrained optimization	6
Resolvent splitting for sums of monotone operators with minimal lifting	6
A parametric approach for solving convex quadratic optimization with indicators over trees	6
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size	6
Complexity of trust-region methods with potentially unbounded Hessian approximations for smooth and nonsmooth optimization	6
Graphical designs and gale duality	6
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs	5
Intersecting and dense restrictions of clutters in polynomial time	5
Exponential Lower Bounds for Many Pivot Rules for the Simplex Method	5
Phragmén’s voting methods and justified representation	5
On circuit diameter bounds via circuit imbalances	5
Bounding the optimal number of policies for robust K-Adaptability	5
Lyapunov stability of the subgradient method with constant step size	5
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds	5
Assortment optimization with visibility constraints	5
An elementary approach to tight worst case complexity analysis of gradient based methods	5
On the maximal number of columns of a $$\Delta $$-modular integer matrix: bounds and computations	5
Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis	5
Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of Newton Method	5
Finding global minima via kernel approximations	5
Lower bounds for non-convex stochastic optimization	5
Gradient regularization of Newton method with Bregman distances	5
A normal fan projection algorithm for low-rank optimization	5
Correction: Efficient Kirszbraun extension with applications to regression	5
Non-asymptotic global convergence rates of BFGS with exact line search	5
Robust Stackelberg Equilibria	5
Cutoff stability under distributional constraints with an application to summer internship matching	5
Total dual dyadicness and dyadic generating sets	5