Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm (Q755430): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5590539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4174523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rapidly Convergent Descent Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Slacked Unconstrained Minimization Technique for Convex Programming / rank
 
Normal rank

Latest revision as of 03:23, 13 June 2024

scientific article
Language Label Description Also known as
English
Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm
scientific article

    Statements

    Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm (English)
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    numerical tests
    0 references
    computational study
    0 references
    comparison of algorithms
    0 references
    Benders' algorithm
    0 references
    Algol program
    0 references
    optimal degree of decomposition
    0 references
    nonlinear programming
    0 references
    decomposition algorithm
    0 references
    convexity
    0 references
    convergence
    0 references
    Sumt algorithm
    0 references