A simple alternating direction method for the conic trust region subproblem (Q1721084)

From MaRDI portal
Revision as of 10:54, 17 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128722853, #quickstatements; #temporary_batch_1723888233194)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simple alternating direction method for the conic trust region subproblem
scientific article

    Statements

    A simple alternating direction method for the conic trust region subproblem (English)
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: A simple alternating direction method is used to solve the conic trust region subproblem of unconstrained optimization. By use of the new method, the subproblem is solved by two steps in a descent direction and its orthogonal direction, the original conic trust domain subproblem into a one-dimensional subproblem and a low-dimensional quadratic model subproblem, both of which are very easy to solve. Then the global convergence of the method under some reasonable conditions is established. Numerical experiment shows that the new method seems simple and effective.
    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
    0 references