Methods of unconditional minimization of functions using a simplex (Q1119477): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Igor' Yaroslavich Zabotin / rank
Normal rank
 
Property / author
 
Property / author: Igor' Yaroslavich Zabotin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5644548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01095651 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027453547 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Methods of unconditional minimization of functions using a simplex
scientific article

    Statements

    Methods of unconditional minimization of functions using a simplex (English)
    0 references
    1979
    0 references
    The problem of unconstrained minimization of continuously differentiable convex functions is considered. Two iterative methods are presented, in which the choice of the descending direction is made with the help of an n-dimensional simplex.
    0 references
    unconstrained minimization
    0 references
    continuously differentiable convex functions
    0 references
    n-dimensional simplex
    0 references
    0 references
    0 references
    0 references

    Identifiers

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