On the accelerating property of an algorithm for function minimization without calculating derivatives (Q1234558): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58186010, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
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: Q5657612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate directions versus quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms / rank
 
Normal rank

Revision as of 19:41, 12 June 2024

scientific article
Language Label Description Also known as
English
On the accelerating property of an algorithm for function minimization without calculating derivatives
scientific article

    Statements

    Identifiers