verified SJR 0,725 · Q2 • database Scopus / SJR & Web of Science indexed

United Kingdom · Taylor and Francis Ltd.

workspace_premium Q2 — Software lock_open Open Access Unclaimed

Optimization Methods and Software

Optimization Methods and Software is a journal indexed in SJR in Software and Applied Mathematics with an H index of 70. It has a price of 2395 €. It has an SJR impact factor of 0,725 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,725.

ISSN: 1055-6788

Editorial: Taylor and Francis Ltd.

Category: Software

Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD

schedule Datos CoP · solo campos en BD

SJR Impact Factor trending_up

0,725 Q2

H-index 70

Tasa de Aceptación pie_chart

28% Selectiva

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

2.395 € Open Access

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,725

H-index

Docs (year)

Docs 3y

196

Total refs

3830

Cites 3y

423

Citable 3y

193

Cites/Doc 2y

1.78

Ref/Doc

40.74

Immediate OA

2395 €

Embargoed OA

NPD

Non OA / Submission

0 €

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims

rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

A projected gradient algorithm for solving the maxcut SDP relaxation

Yury G. Evtushenko -a tribute

An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners

An iterative method for solving stochastic Riccati differential equations for the stochastic LQR problem

An extension of the positive real lemma to descriptor systems

An efficient exact approach for the constrained shortest path tour problem

An alternating direction method of multipliers for the eigenvalue complementarity problem

An algorithm for inverse minimum spanning tree problem

An adaptive self-regular proximity-based large-update IPM for LO

Adjoint gradients compared to gradients from algorithmic differentiation in instantaneous control of the Navier-Stokes equations

Adaptive augmented Lagrangian methods: algorithms and practical numerical experience

A robust multi-batch L-BFGS method for machine learning

SHOW MORE ARTICLES

A quasi-Newton interior point method for semi-infinite programming

A balanced truncation-based strategy for optimal control of evolution problems

A polynomial-time algorithm for linear optimization based on a new simple kernel function

A parallel computational model for sensitivity analysis in optimization for robustness

A nonlinear complementarity approach to multiuser power control for digital subscriber lines

A new trust region method with adaptive radius for unconstrained optimization

A new algorithm for one-warehouse multi-retailer systems under stationary nested policy

A multilevel algorithm for solving the trust-region subproblem

A globally convergent method of moving asymptotes with trust region technique

A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints

A feature selection method for nonparallel plane support vector machine classification

A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques

FAQS

In Country of Papers you can find SJR impact factor and other metrics to help you decide on a Journal.