Cited 2 time in
ON THE BANG-BANG CONTROL APPROACH VIA A COMPONENT-WISE LINE SEARCH STRATEGY FOR UNCONSTRAINED OPTIMIZATION
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, M. S. | - |
| dc.contributor.author | Harno, H. G. | - |
| dc.contributor.author | Goh, B. S. | - |
| dc.contributor.author | Lim, K. H. | - |
| dc.date.accessioned | 2024-12-02T23:00:53Z | - |
| dc.date.available | 2024-12-02T23:00:53Z | - |
| dc.date.issued | 2021-03 | - |
| dc.identifier.issn | 2155-3289 | - |
| dc.identifier.issn | 2155-3297 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/72785 | - |
| dc.description.abstract | A bang-bang iteration method equipped with a component-wise line search strategy is introduced to solve unconstrained optimization problems. The main idea of this method is to formulate an unconstrained optimization problem as an optimal control problem to obtain an optimal trajectory. However, the optimal trajectory can only be generated by impulsive control variables and it is a straight line joining a guessed initial point to a minimum point. Thus, a priori bounds are imposed on the control variables in order to obtain a feasible solution. As a result, the optimal trajectory is made up of bang-bang control sub-arcs, which form an iterative model based on the Lyapunov function's theorem. This is to ensure monotonic decrease of the objective function value and convergence to a desirable minimum point. However, a chattering behavior may occur near the solution. To avoid this behavior, the Newton iterations are then applied to the proposed method via a two-phase approach to achieve fast convergence. Numerical experiments show that this new approach is efficient and cost-effective to solve the unconstrained optimization problems. | - |
| dc.format.extent | 17 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | AMER INST MATHEMATICAL SCIENCES-AIMS | - |
| dc.title | ON THE BANG-BANG CONTROL APPROACH VIA A COMPONENT-WISE LINE SEARCH STRATEGY FOR UNCONSTRAINED OPTIMIZATION | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.3934/naco.2020014 | - |
| dc.identifier.scopusid | 2-s2.0-85101216093 | - |
| dc.identifier.wosid | 000594844400004 | - |
| dc.identifier.bibliographicCitation | NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, v.11, no.1, pp 45 - 61 | - |
| dc.citation.title | NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION | - |
| dc.citation.volume | 11 | - |
| dc.citation.number | 1 | - |
| dc.citation.startPage | 45 | - |
| dc.citation.endPage | 61 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.description.journalRegisteredClass | esci | - |
| dc.relation.journalResearchArea | Mathematics | - |
| dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
| dc.subject.keywordPlus | CONVERGENCE | - |
| dc.subject.keywordPlus | ALGORITHMS | - |
| dc.subject.keywordPlus | STABILITY | - |
| dc.subject.keywordAuthor | Two-phase | - |
| dc.subject.keywordAuthor | bang-bang iterations | - |
| dc.subject.keywordAuthor | rectangular search | - |
| dc.subject.keywordAuthor | unconstrained optimization | - |
| dc.subject.keywordAuthor | component-wise line search | - |
| dc.subject.keywordAuthor | Lyapunov function's theorem | - |
| dc.subject.keywordAuthor | approximate greatest descent | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
