The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212)

From MaRDI portal
scientific article; zbMATH DE number 7822593
Language Label Description Also known as
English
The evaluation complexity of finding high-order minimizers of nonconvex optimization
scientific article; zbMATH DE number 7822593

    Statements

    The evaluation complexity of finding high-order minimizers of nonconvex optimization (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2024
    0 references
    Summary: We introduce the concept of strong high-order approximate minimizers of nonconvex optimization problems. These apply in both standard smooth and composite nonsmooth settings, and additionally allow convex or inexpensive constraints. An adaptive regularization algorithm is then proposed to find such approximate minimizers. Under suitable Lipschitz continuity assumptions, the evaluation complexity of this algorithm is investigated. The bounds obtained not only provide, to the best of our knowledge, the first known result for (unconstrained or inexpensively-constrained) composite problems for optimality orders exceeding one, but also give the first sharp bounds for high-order strong approximate th order minimizers of standard (unconstrained and inexpensively constrained) smooth problems, thereby complementing known results for weak minimizers. For the entire collection see [Zbl 07816361].
    0 references
    nonconvex optimization
    0 references
    composite optimization
    0 references
    regularization methods
    0 references
    complexity bounds
    0 references
    global rates of convergence
    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