Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299)

From MaRDI portal
Revision as of 08:26, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
scientific article

    Statements

    Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 2018
    0 references
    nonlinear programming
    0 references
    derivative-free optimization
    0 references
    quadratic programming
    0 references
    trust-region subproblem
    0 references
    mesh adaptive direct search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references