The dynamic-Q optimization method: an alternative to SQP? (Q1416366): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Jan A. Snyman / rank
Normal rank
 
Property / author
 
Property / author: Jan A. Snyman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for nonlinear constraints that use lagrangian functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic penalty function method for the solution of structural optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new and dynamic method for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LFOPC leap-frog algorithm for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using CFD and mathematical optimization to investigate air pollution due to stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using mathematical optimization in the CFD analysis of a continuous quenching process / rank
 
Normal rank

Latest revision as of 13:23, 6 June 2024

scientific article
Language Label Description Also known as
English
The dynamic-Q optimization method: an alternative to SQP?
scientific article

    Statements

    The dynamic-Q optimization method: an alternative to SQP? (English)
    0 references
    0 references
    0 references
    14 December 2003
    0 references
    0 references
    Constrained optimization
    0 references
    Successive approximations
    0 references
    Sequential quadratic
    0 references
    programming
    0 references