Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function (Q4558290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6982525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function |
scientific article; zbMATH DE number 6982525 |
Statements
Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (English)
0 references
21 November 2018
0 references
standard simplex
0 references
orthogonal projection of a point
0 references
zeros of function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7428622245788574
0 references
0.7398262023925781
0 references
0.7304410934448242
0 references
0.7268995642662048
0 references
0.7268995642662048
0 references
