| # | Title | Journal | Year | Citations |
|---|
| 1 | On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming | Mathematical Programming | 2006 | 6,447 |
| 2 | On the limited memory BFGS method for large scale optimization | Mathematical Programming | 1989 | 5,278 |
| 3 | Benchmarking optimization software with performance profiles | Mathematical Programming | 2002 | 2,980 |
| 4 | An analysis of approximations for maximizing submodular set functions—I | Mathematical Programming | 1978 | 2,779 |
| 5 | On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators | Mathematical Programming | 1992 | 2,031 |
| 6 | Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems | Mathematical Programming | 1976 | 1,585 |
| 7 | Smooth minimization of non-smooth functions | Mathematical Programming | 2005 | 1,568 |
| 8 | Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications | Mathematical Programming | 1990 | 1,499 |
| 9 | Restart procedures for the conjugate gradient method | Mathematical Programming | 1977 | 1,449 |
| 10 | Robust discrete optimization and network flows | Mathematical Programming | 2003 | 1,359 |
| 11 | Robust solutions of Linear Programming problems contaminated with uncertain data | Mathematical Programming | 2000 | 1,228 |
| 12 | Validation of subgradient optimization | Mathematical Programming | 1974 | 1,194 |
| 13 | A nonsmooth version of Newton's method | Mathematical Programming | 1993 | 1,190 |
| 14 | A trust region method based on interior point techniques for nonlinear programming | Mathematical Programming | 2000 | 1,155 |
| 15 | An outer-approximation algorithm for a class of mixed-integer nonlinear programs | Mathematical Programming | 1986 | 1,153 |
| 16 | Adjustable robust solutions of uncertain linear programs | Mathematical Programming | 2004 | 1,126 |
| 17 | Second-order cone programming | Mathematical Programming | 2003 | 1,113 |
| 18 | Semidefinite programming relaxations for semialgebraic problems | Mathematical Programming | 2003 | 1,105 |
| 19 | On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds | Mathematical Programming | 1994 | 1,032 |
| 20 | Robust optimization ? methodology and applications | Mathematical Programming | 2002 | 1,021 |
| 21 | Lattice basis reduction: Improved practical algorithms and solving subset sum problems | Mathematical Programming | 1994 | 1,004 |
| 22 | A polyhedral branch-and-cut approach to global optimization | Mathematical Programming | 2005 | 983 |
| 23 | Proximal alternating linearized minimization for nonconvex and nonsmooth problems | Mathematical Programming | 2014 | 948 |
| 24 | Multi-stage stochastic optimization applied to energy planning | Mathematical Programming | 1991 | 935 |
| 25 | Solving semidefinite-quadratic-linear programs using SDPT3 | Mathematical Programming | 2003 | 884 |
| 26 | The traveling-salesman problem and minimum spanning trees: Part II | Mathematical Programming | 1971 | 843 |
| 27 | Matching, Euler tours and the Chinese postman | Mathematical Programming | 1973 | 832 |
| 28 | A numerically stable dual method for solving strictly convex quadratic programs | Mathematical Programming | 1983 | 807 |
| 29 | Coordinate descent algorithms | Mathematical Programming | 2015 | 805 |
| 30 | Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods | Mathematical Programming | 2013 | 794 |
| 31 | Scenario reduction in stochastic programming | Mathematical Programming | 2003 | 793 |
| 32 | Linear programming with multiple objective functions: Step method (stem) | Mathematical Programming | 1971 | 774 |
| 33 | An interior algorithm for nonlinear optimization that combines line search and trust region steps | Mathematical Programming | 2006 | 769 |
| 34 | Gradient methods for minimizing composite functions | Mathematical Programming | 2013 | 766 |
| 35 | Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations | Mathematical Programming | 2018 | 757 |
| 36 | Pegasos: primal estimated sub-gradient solver for SVM | Mathematical Programming | 2011 | 744 |
| 37 | Fixed point and Bregman iterative methods for matrix rank minimization | Mathematical Programming | 2011 | 739 |
| 38 | Approximation algorithms for scheduling unrelated parallel machines | Mathematical Programming | 1990 | 714 |
| 39 | Some NP-complete problems in quadratic and nonlinear programming | Mathematical Programming | 1987 | 711 |
| 40 | Matroids and the greedy algorithm | Mathematical Programming | 1971 | 681 |
| 41 | Nonlinear programming without a penalty function | Mathematical Programming | 2002 | 653 |
| 42 | Local branching | Mathematical Programming | 2003 | 619 |
| 43 | Some numerical experiments with variable-storage quasi-Newton algorithms | Mathematical Programming | 1989 | 604 |
| 44 | An interactive weighted Tchebycheff procedure for multiple objective programming | Mathematical Programming | 1983 | 598 |
| 45 | Convergence of an annealing algorithm | Mathematical Programming | 1986 | 574 |
| 46 | Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems | Mathematical Programming | 1992 | 554 |
| 47 | A lift-and-project cutting plane algorithm for mixed 0–1 programs | Mathematical Programming | 1993 | 551 |
| 48 | A feasible method for optimization with orthogonality constraints | Mathematical Programming | 2013 | 548 |
| 49 | An approximation algorithm for the generalized assignment problem | Mathematical Programming | 1993 | 526 |
| 50 | Vertex packings: Structural properties and algorithms | Mathematical Programming | 1975 | 524 |
