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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q424383
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Takashi Gyoshin Nitta / rank
 
Normal rank

Revision as of 16:47, 14 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