A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3345690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-linear minimax optimization as a sequence of least<i>p</i>th optimization with finite values of<i>p</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization using interval analysis: The one-dimensional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization using interval analysis - the multi-dimensional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach for computing a posteriori error bounds for the solution of a linear system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4295107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROFIL/BIAS - A fast interval library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the range of a rational function of n variables over a bounded region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Methods for Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion functions and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving minimax problems by interval methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of rational interval functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Error Analysis / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01279453 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026826235 / rank
 
Normal rank

Latest revision as of 11:38, 30 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for bound constrained optimization problems without derivatives
scientific article

    Statements

    A branch-and-bound algorithm for bound constrained optimization problems without derivatives (English)
    0 references
    0 references
    0 references
    0 references
    2 May 1996
    0 references
    0 references
    interval arithmetic
    0 references
    branch-and-bound
    0 references
    global optimization
    0 references
    0 references
    0 references
    0 references