A More Lenient Stopping Rule for Line Search Algorithms (Q4709751): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truncated-Newton algorithms for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line search algorithms with guaranteed sufficient decrease / rank
 
Normal rank
Property / cites work
 
Property / cites work: TNPACK—A truncated Newton minimization package for large-scale problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TNPACK—a truncated Newton minimization package for large-scale problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remark on Algorithm 566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Implementation of the Truncated-Newton Algorithm for Large-Scale Chemistry Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remark on Algorithm 702—the updated truncated Newton minimization package / rank
 
Normal rank

Latest revision as of 16:52, 5 June 2024

scientific article; zbMATH DE number 1932823
Language Label Description Also known as
English
A More Lenient Stopping Rule for Line Search Algorithms
scientific article; zbMATH DE number 1932823

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references