Global optimization in problems with uncertainties: the gamma algorithm. (Q1416293): 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: Q363522 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Messoud A. Efendiev / rank
Normal rank
 
Property / author
 
Property / author: Efim A. Galperin / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Messoud A. Efendiev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cubic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical experiments with one-dimensional adaptive cubic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precision, complexity, and computational schemes of the cubic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fast cubic algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(02)00198-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076472168 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Global optimization in problems with uncertainties: the gamma algorithm.
scientific article

    Statements

    Global optimization in problems with uncertainties: the gamma algorithm. (English)
    0 references
    14 December 2003
    0 references
    A new concept of global optimality is proposed for an uncertain function viewed as unspecified point values of set-valued functions. For the class of interval-valued functions, the optimal interval value is defined leading to double optimization with respect to upper/lower closures of such functions. A monadic iterative algorithm is then developed yielding approximate solutions up to the precision specified in advance. A notion of piecewise continuous function \(f: \mathbb{R}^n\to\mathbb{R}\) is defined and the method is generalized for an uncertain function over a bounded set \(X\subset\mathbb{R}^n\) defined by a closed set-valued function with piecewise Lipschitz continuous upper and lower functions.
    0 references
    global optimization under certainty
    0 references
    double optimality
    0 references
    0 references

    Identifiers