An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence (Q1816337): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Optimization and nonsmooth analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3797760 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713065 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3869076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Technical Note—The Nested Ball Principle for the Relaxation Method / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01131851 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2335532264 / rank | |||
Normal rank |
Latest revision as of 08:35, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence |
scientific article |
Statements
An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence (English)
0 references
20 January 1997
0 references
orthogonal descent method
0 references
unsolvability test
0 references
rate of convergence
0 references