Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905): 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: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to obtaining global extremums in polynomial mathematical programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace kernels and minimum problems in Hilbert spaces with kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual estimates in multiextremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4300106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonalizing linear operators in convex programming. I, II / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02733104 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067277095 / rank
 
Normal rank

Latest revision as of 10:29, 30 July 2024

scientific article
Language Label Description Also known as
English
Modified \(r\)-algorithm to find the global minimum of polynomial functions
scientific article

    Statements

    Modified \(r\)-algorithm to find the global minimum of polynomial functions (English)
    0 references
    28 April 1999
    0 references
    global minimum of a polynomial
    0 references
    several variables
    0 references
    Lagrange function
    0 references
    redundant constraints
    0 references
    quadratic bounds
    0 references
    nonsmooth optimization
    0 references
    0 references
    0 references

    Identifiers