On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms (Q1234559): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Contributions to the theory of the method of steepest descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Multipoint Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of convergence of certain quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a function without calculating derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the accelerating property of an algorithm for function minimization without calculating derivatives / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00933294 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038499513 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms
scientific article

    Statements

    Identifiers