Mathematical Programming

Aims & Scope

Mathematical Programming publishes original articles dealing with every aspect of mathematical optimization; that is, everything of direct or indirect use concerning the problem of optimizing a function of many variables, often subject to a set of constraints.

This involves theoretical and computational issues as well as application studies.

Included, along with the standard topics of linear, nonlinear, integer, conic, stochastic and combinatorial optimization, are techniques for formulating and applying mathematical programming models, convex, nonsmooth and variational analysis, the theory of polyhedra, variational inequalities, and control and game theory viewed from the perspective of mathematical programming.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	2.5
2024	2.20

SJR (SCImago Journal Rank)

Year	Value
2024	1.732

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	149

Journal Rank

Year	Value
2024	1841

Journal Citation Indicator

Year	Value
2024	1550

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

  Citation: 7379

  Authors: Andreas, Lorenz T.

• On the limited memory BFGS method for large scale optimization

  Citation: 5952

  Authors: Dong C., Jorge

• Benchmarking optimization software with performance profiles

  Citation: 3276

  Authors: Elizabeth D., Jorge J.

• An analysis of approximations for maximizing submodular set functions—I

  Citation: 2777

  Authors: G. L., L. A., M. L.

• On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators

  Citation: 2063

  Authors: Jonathan, Dimitri P.

• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

  Citation: 1749

  Authors: Garth P.

• Smooth minimization of non-smooth functions

  Citation: 1512

  Authors: Yu.

• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

  Citation: 1391

  Authors: Patrick T., Jong-Shi

• Robust discrete optimization and network flows

  Citation: 1391

  Authors: Dimitris, Melvyn

• Restart procedures for the conjugate gradient method

  Citation: 1322

  Authors: M. J. D.

---