A sequential convexification method (SCM) for continuous global optimization (Q1422879)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A sequential convexification method (SCM) for continuous global optimization
scientific article

    Statements

    A sequential convexification method (SCM) for continuous global optimization (English)
    0 references
    0 references
    0 references
    12 February 2004
    0 references
    A new method for continuous global minimization problem under the acronym SCM, is introduced. This method gives a simple transformation to convert the objective function to an auxiliary function with gradually `fewer' local minimizers. All local minimizers except a prefixed one of the auxiliary function are in the region where the function value of the objective function is lower than its current minimal value. Based on this method, an algorithm is designed which uses a local optimization method to minimize the auxiliary function to find a local minimizer at which the value of the objective function is lower than its current minimal value. The algorithm converges asymptotically with probability one to a global minimizer of the objective function. Numerical experiments on a set of standard test problems with several problems' dimensions up to 50 show that the algorithm is very efficient compared with other global optimization methods.
    0 references
    0 references
    global minimization
    0 references
    sequential convexification method
    0 references
    auxiliary function
    0 references
    fewer local minimizers
    0 references

    Identifiers