Titlebook: Convex Optimization with Computational Errors; Alexander J. Zaslavski Book 2020 Springer Nature Switzerland AG 2020 convex optimization.ma

Fixate

書目名稱Convex Optimization with Computational Errors影響因子(影響力)




書目名稱Convex Optimization with Computational Errors影響因子(影響力)學科排名




書目名稱Convex Optimization with Computational Errors網(wǎng)絡公開度




書目名稱Convex Optimization with Computational Errors網(wǎng)絡公開度學科排名




書目名稱Convex Optimization with Computational Errors被引頻次




書目名稱Convex Optimization with Computational Errors被引頻次學科排名




書目名稱Convex Optimization with Computational Errors年度引用




書目名稱Convex Optimization with Computational Errors年度引用學科排名




書目名稱Convex Optimization with Computational Errors讀者反饋




書目名稱Convex Optimization with Computational Errors讀者反饋學科排名

黃油沒有

Subgradient Projection Algorithm,f convex–concave functions, under the presence of computational errors. The problem is described by an objective function and a set of feasible points. For this algorithm each iteration consists of two steps. The first step is a calculation of a subgradient of the objective function while in the sec

認識

Gradient Algorithm with a Smooth Objective Function,rs. The problem is described by an objective function and a set of feasible points. For this algorithm each iteration consists of two steps. The first 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

設想

Continuous Subgradient Method,nvex–concave functions, under the presence of computational errors. The problem is described by an objective function and a set of feasible points. For this algorithm we need a calculation of a subgradient of the objective function and a calculation of a projection on the feasible set. In each of th

figurine

Classify

Classify

PDA-Based Method for Convex Optimization, steps. In each of these two steps there is a computational error. In general, these two computational errors 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

吊胃口

filial

A Projected Subgradient Method for Nonsmooth Problems,this 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.

Arb853

Convex Optimization with Computational Errors978-3-030-37822-6Series ISSN 1931-6828 Series E-ISSN 1931-6836