A linearized relaxing algorithm for the specific nonlinear optimization problem (Q1669202): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59121497, #quickstatements; #temporary_batch_1706287054262
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 04:55, 1 February 2024

scientific article
Language Label Description Also known as
English
A linearized relaxing algorithm for the specific nonlinear optimization problem
scientific article

    Statements

    A linearized relaxing algorithm for the specific nonlinear optimization problem (English)
    0 references
    0 references
    0 references
    0 references
    30 August 2018
    0 references
    Summary: We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm. Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem. Numerical results show that this method is more efficient than the previous methods.
    0 references

    Identifiers

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