OOIR: Observatory of International Research

Papers

(The TQCC of Mathematical Programming is 4. 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-02-01 to 2025-02-01.)

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
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
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
Efficient separation of RLT cuts for implicit and explicit bilinear terms	15
K-adaptability in stochastic optimization	15
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
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
A duality based 2-approximation algorithm for maximum agreement forest	13

On the integrality gap of binary integer programs with Gaussian data	13
The mixed integer trust region problem	12
On the robustness of potential-based flow networks	12
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
Beyond symmetry: best submatrix selection for the sparse truncated SVD	11
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians	11
Asymmetry in the complexity of the multi-commodity network pricing problem	11
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
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
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
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
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
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
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
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
Mean robust optimization	6
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020	6
Equilibrium computation in resource allocation games	6
Shapes and recession cones in mixed-integer convex representability	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
Matrix discrepancy and the log-rank conjecture	6
Non-convex exact community recovery in stochastic block model	6
Towards an optimal contention resolution scheme for matchings	6
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship	6
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid	6
Popular branchings and their dual certificates	6
Generalized Nash equilibrium problems with mixed-integer variables	6
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens	6
A slope generalization of Attouch theorem	6
The maximum measure of non-trivial 3-wise intersecting families	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
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