Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer (Q1836281): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Nongradient and Parallel Algorithm for Unconstrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088210 / 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: A Rapidly Convergent Descent Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study on a supermemory gradient method for the minimization of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135211 / rank
 
Normal rank

Revision as of 16:58, 13 June 2024

scientific article
Language Label Description Also known as
English
Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer
scientific article

    Statements

    Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer (English)
    0 references
    0 references
    0 references
    1984
    0 references
    parallel processing
    0 references
    conjugate directions
    0 references
    parallel unidirectional algorithms
    0 references
    parallel multidirectional algorithms
    0 references
    unconstrained optimization
    0 references
    pseudo-conjugate directions
    0 references

    Identifiers