prodrome
发表于 2025-3-23 11:15:32
https://doi.org/10.1007/978-3-030-67572-1this class of problems, an objective function is assumed to be convex but a set of admissible points is not necessarily convex. Our goal is to obtain an .-approximate solution in the presence of computational errors, where . is a given positive number.
OTHER
发表于 2025-3-23 16:22:02
http://reply.papertrans.cn/24/2379/237847/237847_12.png
没有准备
发表于 2025-3-23 20:13:44
Springer Optimization and Its Applicationshttp://image.papertrans.cn/c/image/237847.jpg
Organization
发表于 2025-3-23 22:30:23
https://doi.org/10.1007/978-94-007-5934-3In this chapter we analyze the mirror descent algorithm for minimization of convex and nonsmooth functions and for computing the saddle points of convex–concave functions, under the presence of computational errors. The problem is described by an objective function and a set of feasible points.
比赛用背带
发表于 2025-3-24 02:28:44
http://reply.papertrans.cn/24/2379/237847/237847_15.png
initiate
发表于 2025-3-24 08:20:43
http://reply.papertrans.cn/24/2379/237847/237847_16.png
贪婪性
发表于 2025-3-24 10:43:14
http://reply.papertrans.cn/24/2379/237847/237847_17.png
machination
发表于 2025-3-24 18:20:25
http://reply.papertrans.cn/24/2379/237847/237847_18.png
Fissure
发表于 2025-3-24 21:56:29
Minimization of Sharp Weakly Convex Functions,In this chapter we study the subgradient projection algorithm for minimization of sharp weakly convex functions, under the presence of computational errors. The problem is described by an objective function and a set of feasible points.
extract
发表于 2025-3-25 02:13:40
https://doi.org/10.1007/978-3-030-37822-6convex optimization; mathematical programming; computational error; nonlinear analysis; solving real-wor