Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
The discussion takes into consideration the fact that for every algorithm its iteration consists of several steps and that computational errors for di?erent steps are di?erent, in general.
Alexander J. Zaslavski is professor in the Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel.
1. Introduction.- 2. Nonsmooth Convex Optimization.- 3. Extensions.- 4. Zero-sum Games with Two Players.- 5. Quasiconvex Optimization.- References.
“The book is rigorously written, and organized taking into account the cursiveness of reading. The long proofs of the theorems are placed in annexes to chapters, in order to emphasize the importance of every result in a generating methodology of studying and solving problems.” (Gabriela Cristescu, zbMATH 1464.90063, 2021)