Titlebook: Approximation and Complexity in Numerical Optimization; Continuous and Discr Panos M. Pardalos Book 2000 Springer Science+Business Media Do

显示全部楼层 · 发表于 2025-3-25 16:30:43

Convergence Rate of the P-Algorithm for Optimization of Continuous Functions,on as a sample path of a Gaussian process. In this paper we analyze the convergence of the P-algorithm for arbitrary continuous functions, as well as under the assumption of Wiener measure on the objective functions. In both cases the convergence rate is described in terms of a parameter of the algorithm and a functional of the objective function.

显示全部楼层 · 发表于 2025-3-25 21:40:26

显示全部楼层 · 发表于 2025-3-26 03:43:16

显示全部楼层 · 发表于 2025-3-26 06:05:49

Approximation and Complexity in Numerical Optimization978-1-4757-3145-3Series ISSN 1571-568X

显示全部楼层 · 发表于 2025-3-26 11:38:51

显示全部楼层 · 发表于 2025-3-26 13:47:38

显示全部楼层 · 发表于 2025-3-26 20:23:51

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	SITEMAP	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 08:43
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved

Titlebook: Approximation and Complexity in Numerical Optimization; Continuous and Discr Panos M. Pardalos Book 2000 Springer Science+Business Media Do

浏览过的版块