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

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-25 21:40:26

只看該作者 · 發(fā)表于 2025-3-26 03:43:16

只看該作者 · 發(fā)表于 2025-3-26 06:05:49

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

只看該作者 · 發(fā)表于 2025-3-26 11:38:51

只看該作者 · 發(fā)表于 2025-3-26 13:47:38

只看該作者 · 發(fā)表于 2025-3-26 20:23:51

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-17 05:17
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved