Journal of Global Optimization

短名J Glob Optim
Journal Impact1.24
国际分区OPERATIONS RESEARCH & MANAGEMENT SCIENCE(Q4)
期刊索引SCI Q2中科院 3 区
ISSN0925-5001, 1573-2916
h-index96
国内分区数学(3区)数学应用数学(4区)数学运筹学与管理科学(4区)

《全球优化杂志》发表了经过仔细审查的论文,这些论文涵盖了全球优化的理论、计算和应用方面。虽然重点是处理寻找非凸、多极值问题的全局最优的原始研究贡献,但该期刊的范围涵盖最广泛意义上的优化,包括非线性、混合整数、组合、随机、稳健、多目标优化、计算几何和平衡问题。对数据驱动方法和基于优化的数据挖掘的相关工作特别感兴趣。除了涵盖全局优化理论和算法的论文外,该杂志还发表了关于数值实验、新测试平台以及工程、管理和应用领域的重要论文。科学。特别感兴趣的应用包括医疗保健、计算生物化学、能源系统、电信和金融。除了长篇文章外,该杂志还针对开放和已解决的全局优化问题进行了简短的交流。它还提供相关书籍的评论并出版特刊。

期刊主页投稿网址
涉及主题数学数学优化计算机科学算法数学分析几何学应用数学物理经济程序设计语言生物组合数学量子力学工程类纯数学人工智能哲学统计机器学习遗传学离散数学
出版信息出版商: Springer Netherlands出版周期: Monthly期刊类型: journal
基本数据创刊年份: 1991原创研究文献占比100.00%自引率:7.70%Gold OA占比: 22.64%
平均审稿周期 网友分享经验:偏慢,4-8周
平均录用比例网友分享经验:容易

期刊引文格式

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

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

只有1位作者的期刊

有2位作者的期刊

有3位作者的期刊

有5位以上作者的期刊

书籍引用格式

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

学位论文引用格式

网页引用格式

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

专利引用格式

最新文章

Improved approximation algorithms for the k-path partition problem

2024-9-13

On convergence of a q-random coordinate constrained algorithm for non-convex problems

2024-9-12

A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization

2024-9-12

A reformulation-enumeration MINLP algorithm for gas network design

2024-9-3

Budget-constrained profit maximization without non-negative objective assumption in social networks

2024-8-14

A two-phase sequential algorithm for global optimization of the standard quadratic programming problem

2024-8-12

The limitation of neural nets for approximation and optimization

2024-8-9

Relaxed projection methods for solving variational inequality problems

2024-8-8

Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification

2024-8-7

Robust bilevel optimization for near-optimal lower-level solutions

2024-7-30

Strong convergence of the composition of firmly nonexpansive mappings

2024-7-27

Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem

2024-7-22

Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling

2024-7-20

A method based on parametric convex programming for solving convex multiplicative programming problem

2024-7-18

A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming

2024-7-17

A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression

2024-7-16

Modified general splitting method for the split feasibility problem

2024-7-10

Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach

2024-7-8

Parallel machine scheduling with position-dependent processing times and deteriorating maintenance activities

2024-6-27

Packing spheres with quasi-containment conditions

2024-6-21

Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric

2024-6-20

Curvature-constrained Steiner networks with three terminals

2024-6-17

Online non-monotone diminishing return submodular maximization in the bandit setting

2024-6-13

A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines

2024-6-12

A Bayesian approach to data-driven multi-stage stochastic optimization

2024-6-7

On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints

2024-5-30

Deep learning the efficient frontier of convex vector optimization problems

2024-5-30

Optimization in complex spaces with the mixed Newton method

2024-5-30

A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems

2024-5-29

Node selection through upper bounding local search methods in branch & bound solvers for NCOPs

2024-5-25

The edge labeling of higher order Voronoi diagrams

2024-5-21

A revised monotonicity-based method for computing tight image enclosures of functions

2024-5-16

Dual optimality conditions for the difference of extended real valued increasing co-radiant functions

2024-5-11

On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy

2024-5-10

Rectilinear convex hull of points in 3D and applications

2024-5-4

Subspace Newton method for sparse group $$\ell _0$$ optimization problem

2024-4-29

Tighter bound estimation for efficient biquadratic optimization over unit spheres

2024-4-29

Social equity in international environmental agreements

2024-4-29

Distributed accelerated gradient methods with restart under quadratic growth condition

2024-4-24

Characteristic sets and characteristic numbers of matrix two-person games

2024-4-18

The projected-type method for the extended vertical linear complementarity problem revisited

2024-4-18

Relaxations and cutting planes for linear programs with complementarity constraints

2024-4-18

Gradient projection method on the sphere, complementarity problems and copositivity

2024-4-16

A new optimization approach to solving split equality problems in Hilbert spaces

2024-4-13

Almost optimal manipulation of pairwise comparisons of alternatives

2024-4-12

Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming

2024-4-8

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms

2024-3-25

Modification and improved implementation of the RPD method for computing state relaxations for global dynamic optimization

2024-3-23

A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization

2024-3-23

On the use of overlapping convex hull relaxations to solve nonconvex MINLPs

2024-3-22

帮你贴心管理全部的文献

研飞ivySCI,高效的论文管理

投稿经验分享

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

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