Optimization Methods and Software

短名Optim. Methods. Softw.
Journal Impact1.28
国际分区OPERATIONS RESEARCH & MANAGEMENT SCIENCE(Q3)
期刊索引SCI Q1中科院 3 区
ISSN1026-7670, 1029-4937, 1055-6788
h-index67
国内分区数学(3区)数学计算机软件工程(3区)数学应用数学(3区)数学运筹学与管理科学(3区)

优化方法和软件发表关于优化方法理论和实现的最新进展的参考论文,特别强调软件开发和算法设计之间的接口。主题包括:线性、非线性算法和计算机代码的理论、实现和性能评估,离散,随机优化和最优控制。这尤其包括通过确定性或非确定性算法进行的圆锥、半定、混合整数、网络、非光滑、多目标和全局优化。用于互补性、变分不等式和平衡问题以及解决逆问题的算法和软件,非线性方程组和参数相关算子的数值研究。高效和用户友好的实现的各个方面:例如自动微分,大规模并行优化,分布式计算,在线算法,误差敏感性和有效性分析,问题缩放,停止标准和符号数字接口。具有明显应用潜力的理论研究和特别适用的优化方法和软件在领域的成功应用比如工程、机器学习、数据挖掘、经济学、金融、生物学或医学。这些提交不应仅包含直接使用标准优化技术。

出版信息出版商: Taylor and Francis Ltd.出版周期: 期刊类型: journal
基本数据创刊年份: 1992原创研究文献占比自引率:Gold OA占比:

期刊引文格式

这些示例是对学术期刊文章的引用,以及它们应该如何出现在您的参考文献中。

并非所有期刊都按卷和期组织其已发表的文章,因此这些字段是可选的。有些电子期刊不提供页面范围,而是列出文章标识符。在这种情况下,使用文章标识符而不是页面范围是安全的。

只有1位作者的期刊

有2位作者的期刊

有3位作者的期刊

有5位以上作者的期刊

书籍引用格式

以下是创作和编辑的书籍的参考文献的示例。

学位论文引用格式

网页引用格式

这些示例是对网页的引用,以及它们应该如何出现在您的参考文献中。

专利引用格式

最新文章

Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems

2024-9-13

Automatic source code generation for deterministic global optimization with parallel architectures

2024-9-13

A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems

2024-8-14

An investigation of stochastic trust-region based algorithms for finite-sum minimization

2024-8-8

A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property

2024-7-29

Matrix extreme points and free extreme points of free spectrahedra

2024-7-29

Numerical methods for distributed stochastic compositional optimization problems with aggregative structure

2024-7-25

Analysis and comparison of two-level KFAC methods for training deep neural networks

2024-7-24

Observability inequality of backward stochastic heat equations with Lévy process for measurable sets and its applications

2024-7-24

A new spectral conjugate subgradient method with application in computed tomography image reconstruction

2024-7-24

The Dai–Liao-type conjugate gradient methods for solving vector optimization problems

2024-7-23

Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments

2024-7-5

A note on the generalized Hessian of the least squares associated with systems of linear inequalities

2024-7-5

Numerical simulation of differential-algebraic equations with embedded global optimization criteria

2024-7-5

On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions

2024-7-4

Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition

2024-6-27

Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems

2024-6-20

A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity

2024-5-31

A family of limited memory three term conjugate gradient methods

2024-5-23

Maximizing the number of rides served for time-limited Dial-a-Ride*

2024-5-23

A semismooth conjugate gradients method – theoretical analysis

2024-5-23

Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations

2024-5-21

Robust reverse 1-center problems on trees with interval costs

2024-5-21

A mixed-integer programming formulation for optimizing the double row layout problem

2024-5-21

Approximating Hessian matrices using Bayesian inference: a new approach for quasi-Newton methods in stochastic optimization

2024-4-29

An active set method for bound-constrained optimization

2024-4-26

AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems

2024-4-26

Derivative-free bound-constrained optimization for solving structured problems with surrogate models

2024-4-15

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

2024-4-8

An optimal interpolation set for model-based derivative-free optimization methods

2024-4-8

Linear programming sensitivity measured by the optimal value worst-case analysis

2024-4-7

A new inexact gradient descent method with applications to nonsmooth convex optimization

2024-3-25

On generalized Nash equilibrium problems in infinite-dimensional spaces using Nikaido–Isoda type functionals

2024-3-20

Toward state estimation by high gain differentiators with automatic differentiation

2024-3-14

Decentralized gradient tracking with local steps

2024-3-14

Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations

2024-2-20

Complexity of a class of first-order objective-function-free optimization algorithms

2024-2-8

Sequential hierarchical least-squares programming for prioritized non-linear optimal control

2024-2-8

Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods

2024-2-5

Optimized convergence of stochastic gradient descent by weighted averaging

2024-2-5

Optimal inexactness schedules for tunable oracle-based methods

2024-2-5

PathWyse: a flexible, open-source library for the resource constrained shortest path problem

2024-2-5

Three-operator reflected forward-backward splitting algorithm with double inertial effects

2024-2-5

Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem

2024-1-28

Predicting pairwise interaction affinities with ℓ <sub>0</sub> -penalized least squares–a nonsmooth bi-objective optimization based approach*

2024-1-24

Decentralized saddle point problems via non-Euclidean mirror prox

2024-1-24

Shape-changing trust-region methods using multipoint symmetric secant matrices

2024-1-24

Delay-tolerant distributed Bregman proximal algorithms

2024-1-24

Barzilai–Borwein-like rules in proximal gradient schemes for ℓ <sub>1</sub> -regularized problems

2024-1-24

The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results

2024-1-19

帮你贴心管理全部的文献

研飞ivySCI,高效的论文管理

投稿经验分享

分享我的经验,帮你走得更远

Built withby Ivy Science
Copyright © 2020-2024
版权所有:南京青藤格致信息科技有限公司