Local saddle point and a class of convexification methods for nonconvex optimization problems (Q2460140)

From MaRDI portal
Revision as of 22:49, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Local saddle point and a class of convexification methods for nonconvex optimization problems
scientific article

    Statements

    Local saddle point and a class of convexification methods for nonconvex optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2007
    0 references
    A class of general transformation methods is proposed to convert a nonconvex optimization problem to another equivalent problem. It is shown that under certain assumptions the existence of a local saddle point or local convexity of the Lagrangian function of the equivalent problem can be guaranteed. Numerical experiments are given to demonstrate the main results geometrically.
    0 references
    0 references
    nonconvex optimization
    0 references
    local saddle point
    0 references
    convexification
    0 references
    local convexity
    0 references

    Identifiers