Condition number based complexity estimate for computing local extrema (Q1026449): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4418650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of exclusion algorithms for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some interior-point algorithms for nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4372496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates depending on condition and round-off error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank

Revision as of 16:44, 1 July 2024

scientific article
Language Label Description Also known as
English
Condition number based complexity estimate for computing local extrema
scientific article

    Statements

    Condition number based complexity estimate for computing local extrema (English)
    0 references
    0 references
    0 references
    25 June 2009
    0 references
    steepest descent method
    0 references
    Sturm's theorem
    0 references
    grid subdivision
    0 references
    condition number
    0 references
    singly exponential
    0 references

    Identifiers