A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem
Joint Authors
Horai, Mio
Nitta, Takashi G.
Kobayashi, Hideo
Source
Issue
Vol. 2016, Issue 2016 (31 Dec. 2016), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2016-06-02
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Horai, Mio& Kobayashi, Hideo& Nitta, Takashi G.. 2016. A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem. Abstract and Applied Analysis،Vol. 2016, no. 2016, pp.1-8.
https://search.emarefa.net/detail/BIM-1079420
Modern Language Association (MLA)
Horai, Mio…[et al.]. A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem. Abstract and Applied Analysis No. 2016 (2016), pp.1-8.
https://search.emarefa.net/detail/BIM-1079420
American Medical Association (AMA)
Horai, Mio& Kobayashi, Hideo& Nitta, Takashi G.. A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem. Abstract and Applied Analysis. 2016. Vol. 2016, no. 2016, pp.1-8.
https://search.emarefa.net/detail/BIM-1079420
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1079420