SIAM Journal on Optimization

Aims & Scope

The SIAM Journal on Optimization contains research articles on the theory and practice of optimization.

The areas addressed include linear and quadratic programming, convex programming, nonlinear programming, complementarity problems, stochastic optimization, combinatorial optimization, integer programming, and convex, nonsmooth and variational analysis.

Contributions may emphasize optimization theory, algorithms, software, computational practice, applications, or the links between these subjects.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	2.3
2024	2.60

SJR (SCImago Journal Rank)

Year	Value
2024	1.388

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	152

Journal Rank

Year	Value
2024	2742

Journal Citation Indicator

Year	Value
2024	1031

---

---

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.

• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions

  Citation: 5792

  Authors: Jeffrey C., James A., Margaret H., Paul E.

• A Singular Value Thresholding Algorithm for Matrix Completion

  Citation: 4421

  Authors: Jian-Feng, Emmanuel J., Zuowei

• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds

  Citation: 2595

  Authors: Thomas F., Yuying

• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

  Citation: 2140

  Authors: Indraneel, J. E.

• Global Optimization with Polynomials and the Problem of Moments

  Citation: 1712

  Authors: Jean B.

• The Sample Average Approximation Method for Stochastic Discrete Optimization

  Citation: 1457

  Authors: Anton J., Alexander, Tito

• An Interior Point Algorithm for Large-Scale Nonlinear Programming

  Citation: 1322

  Authors: Richard H., Mary E., Jorge

• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

  Citation: 1221

  Authors: Philip E., Walter, Michael A.

• On the Implementation of a Primal-Dual Interior Point Method

  Citation: 1129

  Authors: Sanjay

• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations

  Citation: 1063

  Authors: Krister

---