相互影响
发表于 2025-3-28 15:26:03
http://reply.papertrans.cn/24/2379/237847/237847_41.png
虚假
发表于 2025-3-28 22:21:15
http://reply.papertrans.cn/24/2379/237847/237847_42.png
cardiac-arrest
发表于 2025-3-29 01:40:32
http://reply.papertrans.cn/24/2379/237847/237847_43.png
PAEAN
发表于 2025-3-29 06:42:45
An Optimization Problems with a Composite Objective Function,rors are different. We show that our algorithm generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if we know the computational errors for the two steps of our algorithm, we find out what approximate solution can be obtained and how many iterates one needs for this.
Commonwealth
发表于 2025-3-29 10:51:01
A Zero-Sum Game with Two Players,e computational errors are bounded from above by a small positive constant. Moreover, if we know the computational errors for the two steps of our algorithm, we find out what approximate solution can be obtained and how many iterates one needs for this.
ACRID
发表于 2025-3-29 14:49:53
http://reply.papertrans.cn/24/2379/237847/237847_46.png
ellagic-acid
发表于 2025-3-29 17:07:50
Continuous Subgradient Method, that our algorithm generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if we know the computational errors for the two calculations of our algorithm, we find out what approximate solution can be obtained and how much time one needs for this.
Foregery
发表于 2025-3-29 22:49:42
http://reply.papertrans.cn/24/2379/237847/237847_48.png
aviator
发表于 2025-3-30 01:13:19
Safety and Epistemic Frankfurt Cases, step is a calculation of a gradient of the objective function while in the second one we calculate a projection on the feasible set. In each of these two steps there is a computational error. In general, these two computational errors are different.
弄脏
发表于 2025-3-30 06:55:40
https://doi.org/10.1007/978-3-030-67572-1m generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if we know the computational errors for the two steps of our algorithm, we find out what approximate solution can be obtained and how many iterates one needs for this.