A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2016/1304954 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849395417128632320 |
|---|---|
| author | Mio Horai Hideo Kobayashi Takashi G. Nitta |
| author_facet | Mio Horai Hideo Kobayashi Takashi G. Nitta |
| author_sort | Mio Horai |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-ab9a1deb555f468fbddda35f72384c87 |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2016-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-ab9a1deb555f468fbddda35f72384c872025-08-20T03:39:37ZengWileyAbstract and Applied Analysis1085-33751687-04092016-01-01201610.1155/2016/13049541304954A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization ProblemMio Horai0Hideo Kobayashi1Takashi G. Nitta2Faculty of Engineering, Graduate School of Engineering, Mie University, Kurimamachiyamachi, Tsu 514-8507, JapanFaculty of Engineering, Graduate School of Engineering, Mie University, Kurimamachiyamachi, Tsu 514-8507, JapanDepartment of Mathematics, Mie University, Kurimamachiyamachi, Tsu 514-8507, JapanWe 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.http://dx.doi.org/10.1155/2016/1304954 |
| spellingShingle | Mio Horai Hideo Kobayashi Takashi G. Nitta A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem Abstract and Applied Analysis |
| title | A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem |
| title_full | A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem |
| title_fullStr | A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem |
| title_full_unstemmed | A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem |
| title_short | A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem |
| title_sort | linearized relaxing algorithm for the specific nonlinear optimization problem |
| url | http://dx.doi.org/10.1155/2016/1304954 |
| work_keys_str_mv | AT miohorai alinearizedrelaxingalgorithmforthespecificnonlinearoptimizationproblem AT hideokobayashi alinearizedrelaxingalgorithmforthespecificnonlinearoptimizationproblem AT takashignitta alinearizedrelaxingalgorithmforthespecificnonlinearoptimizationproblem AT miohorai linearizedrelaxingalgorithmforthespecificnonlinearoptimizationproblem AT hideokobayashi linearizedrelaxingalgorithmforthespecificnonlinearoptimizationproblem AT takashignitta linearizedrelaxingalgorithmforthespecificnonlinearoptimizationproblem |