- Title
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Creator
- Wu, Zhiyou; Bai, Fusheng; Tian, Jing
- Date
- 2017
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/158368
- Identifier
- vital:11784
- Identifier
-
https://doi.org/10.1007/s40305-017-0157-3
- Identifier
- ISSN:2194-668X
- Abstract
- In this paper, an optimality condition for nonlinear programming problems with box constraints is given by using linear transformation and Lagrange interpolating polynomials. Based on this condition, two new local optimization methods are developed. The solution points obtained by the new local optimization methods can improve the Karush–Kuhn–Tucker (KKT) points in general. Two global optimization methods then are proposed by combining the two new local optimization methods with a filled function method. Some numerical examples are reported to show the effectiveness of the proposed methods. © 2017, Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag Berlin Heidelberg.
- Publisher
- Springer Berlin Heidelberg
- Relation
- Journal of the Operations Research Society of China Vol. 5, no. 2 (2017), p. 193-218
- Rights
- Copyright © 2017, Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag Berlin Heidelberg.
- Rights
- This metadata is freely available under a CCO license
- Subject
- Global optimization method; Lagrange interpolating polynomials; Linear transformation; Nonlinear programming; Optimality conditions; 0102 Applied Mathematics
- Reviewed
- Hits: 842
- Visitors: 778
- Downloads: 2
| Thumbnail | File | Description | Size | Format |
|---|