ON THE BANG-BANG CONTROL APPROACH VIA A COMPONENT-WISE LINE SEARCH STRATEGY FOR UNCONSTRAINED OPTIMIZATIONopen access
- Authors
- Lee, M. S.; Harno, H. G.; Goh, B. S.; Lim, K. H.
- Issue Date
- Mar-2021
- Publisher
- AMER INST MATHEMATICAL SCIENCES-AIMS
- Keywords
- Two-phase; bang-bang iterations; rectangular search; unconstrained optimization; component-wise line search; Lyapunov function's theorem; approximate greatest descent
- Citation
- NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, v.11, no.1, pp 45 - 61
- Pages
- 17
- Indexed
- SCOPUS
ESCI
- Journal Title
- NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION
- Volume
- 11
- Number
- 1
- Start Page
- 45
- End Page
- 61
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/72785
- DOI
- 10.3934/naco.2020014
- ISSN
- 2155-3289
2155-3297
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.