Mathematical Programming

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 2020-02-01 to 2024-02-01.)
ArticleCitations
A generic exact solver for vehicle routing and related problems81
Distributed stochastic gradient tracking methods77
Strong mixed-integer programming formulations for trained neural networks68
First-order optimization algorithms via inertial systems with Hessian driven damping50
Understanding the acceleration phenomenon via high-resolution differential equations31
Tikhonov regularization of a second order dynamical system with Hessian driven damping30
Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning26
Accelerated proximal point method for maximally monotone operators22
The sum-of-squares hierarchy on the sphere and applications in quantum information theory22
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization21
Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets20
Riemannian proximal gradient methods18
Generalized monotone operators and their averaged resolvents17
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity17
On the tightness of SDP relaxations of QCQPs15
Mixed-integer optimal control problems with switching costs: a shortest path approach15
The generalized trust region subproblem: solution complexity and convex hull results14
Sparse regression at scale: branch-and-bound rooted in first-order optimization14
Mixed-integer optimal control under minimum dwell time constraints13
Prophet secretary through blind strategies13
Optimal complexity and certification of Bregman first-order methods13
An augmented Lagrangian method for optimization problems with structured geometric constraints13
Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality13
Adaptive regularization with cubics on manifolds13
Outer-product-free sets for polynomial optimization and oracle-based cuts13
New characterizations of Hoffman constants for systems of linear constraints13
On the linear convergence rates of exchange and continuous methods for total variation minimization12
Statistical robustness in utility preference robust optimization models12
Inexact accelerated high-order proximal-point methods12
Dynamic flows with adaptive route choice12
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions12
Projective splitting with forward steps12
Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization11
Rates of superlinear convergence for classical quasi-Newton methods11
A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming11
On the local stability of semidefinite relaxations11
Stochastic first-order methods for convex and nonconvex functional constrained optimization11
Analysis of biased stochastic gradient descent using sequential semidefinite programs11
Outer approximation for global optimization of mixed-integer quadratic bilevel problems11
Robust multidimensional pricing: separation without regret10
Bootstrap robust prescriptive analytics10
Outer approximation for integer nonlinear programs via decision diagrams10
New extremal principles with applications to stochastic and semi-infinite programming10
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion10
Distributionally robust stochastic programs with side information based on trimmings10
Scalable subspace methods for derivative-free nonlinear least-squares optimization9
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators9
Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes9
On linear optimization over Wasserstein balls9
A hybrid stochastic optimization framework for composite nonconvex optimization8
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians8
Better and simpler error analysis of the Sinkhorn–Knopp algorithm for matrix scaling8
Sparse noncommutative polynomial optimization8
Lower bounds on the size of general branch-and-bound trees8
Inexact stochastic mirror descent for two-stage nonlinear stochastic programs8
Submodular function minimization and polarity8
Computing the nucleolus of weighted cooperative matching games in polynomial time8
An exact algorithm for robust influence maximization8
Stochastic Lipschitz dynamic programming8
Stochastic quasi-gradient methods: variance reduction via Jacobian sketching8
A control-theoretic perspective on optimal high-order optimization8
A globally convergent proximal Newton-type method in nonsmooth convex optimization8
Ideal formulations for constrained convex optimization problems with indicator variables8
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making8
The integrality number of an integer program7
Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions7
From differential equation solvers to accelerated first-order methods for convex optimization7
On lower iteration complexity bounds for the convex concave saddle point problems7
Random projections for quadratic programs7
Polynomial-time algorithms for multimarginal optimal transport problems with structure7
Mixing convex-optimization bounds for maximum-entropy sampling7
Accelerating variance-reduced stochastic gradient methods7
Unit stepsize for the Newton method close to critical solutions7
A frequency-domain analysis of inexact gradient methods7
Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization7
Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization7
The condition number of a function relative to a set7
Sparse optimization on measures with over-parameterized gradient descent7
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming6
Constrained composite optimization and augmented Lagrangian methods6
Semidefinite programming hierarchies for constrained bilinear optimization6
Exact solution of network flow models with strong relaxations6
Chebyshev center of the intersection of balls: complexity, relaxation and approximation6
A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization6
Finding and verifying the nucleolus of cooperative games6
Sum-of-squares hierarchies for binary polynomial optimization6
Complexity of packing common bases in matroids6
First-order inertial algorithms involving dry friction damping6
Generalized stochastic Frank–Wolfe algorithm with stochastic “substitute” gradient for structured convex optimization6
Strong formulations for conic quadratic optimization with indicator variables6
A framework for generalized Benders’ decomposition and its application to multilevel optimization6
Non-convex nested Benders decomposition6
Fair colorful k-center clustering6
Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations6
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems6
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization6
Unifying mirror descent and dual averaging5
Error bounds and a condition number for the absolute value equations5
Dynamic probabilistic constraints under continuous random distributions5
Lower bounds for non-convex stochastic optimization5
On the effective Putinar’s Positivstellensatz and moment approximation5
Connecting optimization with spectral analysis of tri-diagonal matrices5
Existence of efficient and properly efficient solutions to problems of constrained vector optimization5
An optimal gradient method for smooth strongly convex minimization5
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting5
A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs5
Optimization on flag manifolds5
Box-total dual integrality, box-integrality, and equimodular matrices5
Parallel random block-coordinate forward–backward algorithm: a unified convergence analysis5
Complexity of linear relaxations in integer programming5
Iteratively reweighted least squares and slime mold dynamics: connection and convergence5
A solution framework for linear PDE-constrained mixed-integer problems5
Sparse PSD approximation of the PSD cone5
Convex generalized Nash equilibrium problems and polynomial optimization5
Idealness of k-wise intersecting families5
Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse5
A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models5
Decomposition of arrow type positive semidefinite matrices with application to topology optimization5
Chance-constrained set covering with Wasserstein ambiguity5
Implications, conflicts, and reductions for Steiner trees5
Complexity of stochastic dual dynamic programming5
Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry5
A primal–dual algorithm for risk minimization5
On the computation of equilibria in monotone and potential stochastic hierarchical games5
On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling5
Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints5
Compactness and convergence rates in the combinatorial integral approximation decomposition5
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm5
A general framework for handling commitment in online throughput maximization5
Graph coloring with decision diagrams5
Resolvent splitting for sums of monotone operators with minimal lifting5
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens5
Simple bilevel programming and extensions5
Complexity of branch-and-bound and cutting planes in mixed-integer optimization5
A robust approach to warped Gaussian process-constrained optimization5
Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions4
A sequential homotopy method for mathematical programming problems4
Subregular recourse in nonlinear multistage stochastic optimization4
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring4
Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization4
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems4
General bounds for incremental maximization4
A Lagrange–Newton algorithm for sparse nonlinear programming4
Sum-of-squares chordal decomposition of polynomial matrix inequalities4
Further results on an abstract model for branching and its application to mixed integer programming4
An exponential lower bound for Zadeh’s pivot rule4
Risk-neutral PDE-constrained generalized Nash equilibrium problems4
A new contraction technique with applications to congruency-constrained cuts4
An exact penalty approach for optimization with nonnegative orthogonality constraints4
About the complexity of two-stage stochastic IPs4
Improving the integrality gap for multiway cut4
A graph-based decomposition method for convex quadratic optimization with indicators4
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates4
Curiosities and counterexamples in smooth convex optimization4
On sample average approximation for two-stage stochastic programs without relatively complete recourse4
On the implementation and strengthening of intersection cuts for QCQPs4
Extended formulations from communication protocols in output-efficient time4
Decreasing minimization on M-convex sets: background and structures4
Best approximation mappings in Hilbert spaces4
Computation and efficiency of potential function minimizers of combinatorial congestion games4
Duality for constrained robust sum optimization problems4
Empowering the configuration-IP: new PTAS results for scheduling with setup times4
An $$O(s^r)$$-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems4
A computational status update for exact rational mixed integer programming4
0.022320032119751