Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Authors: Wu, Zhiyou , Bai, Fusheng , Tian, Jing
- Date: 2017
- Type: Text , Journal article
- Relation: Journal of the Operations Research Society of China Vol. 5, no. 2 (2017), p. 193-218
- Full Text: false
- Reviewed:
- Description: 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.
A new auxiliary function method for systems of nonlinear equations
- Authors: Wu, Zhiyou , Bai, Fusheng , Li, Guoquan , Yang, Yongjian
- Date: 2014
- Type: Text , Journal article
- Relation: Journal of Industrial and Management Optimization Vol. 11, no. 2 (2014), p. 345-364
- Full Text: false
- Reviewed:
- Description: In this paper, we present a new global optimization method to solve nonlinear systems of equations. We reformulate given system of nonlinear equations as a global optimization problem and then give a new auxiliary function method to solve the reformulated global optimization problem. The new auxiliary function proposed in this paper can be a filled function, a quasifilled function or a strict filled function with appropriately chosen parameters. Several numerical examples are presented to illustrate the effciency of the present approach.
A new auxiliary function method for general constrained global optimization
- Authors: Wu, Zhiyou , Bai, Fusheng , Yang, Yongjian , Mammadov, Musa
- Date: 2013
- Type: Text , Journal article
- Relation: Optimization Vol. 62, no. 2 (2013), p. 193-210
- Full Text:
- Reviewed:
- Description: In this article, we first propose a method to obtain an approximate feasible point for general constrained global optimization problems (with both inequality and equality constraints). Then we propose an auxiliary function method to obtain a global minimizer or an approximate global minimizer with a required precision for general global optimization problems by locally solving some unconstrained programming problems. Some numerical examples are reported to demonstrate the efficiency of the present optimization method. © 2013 Taylor & Francis.
- Description: 2003011103
An integral function and vector sequence method for unconstrained global optimization
- Authors: Yang, Yongjian , Bai, Fusheng
- Date: 2011
- Type: Text , Journal article
- Relation: Journal of Global Optimization Vol. 50, no. 2 (2011), p. 293-311
- Full Text: false
- Reviewed:
- Description: An integral function and a vector sequence are constructed in this paper. Their theoretical and numerical properties are investigated. Based on the integral function and the vector sequence, an algorithm is proposed for solving a class of unconstrained global optimization problems. For the algorithm, convergence to a global minimizer is discussed under some conditions. Some typical examples are tested to illustrate the efficiency of the algorithm. © Springer Science+Business Media, LLC. 2010.
A filled function method for nonlinear equations
- Authors: Wu, Zhiyou , Mammadov, Musa , Bai, Fusheng , Yang, Y. J.
- Date: 2007
- Type: Text , Journal article
- Relation: Applied Mathematics and Computation Vol. 189, no. 2 (2007), p. 1196-1204
- Full Text: false
- Reviewed:
- Description: In this paper, we propose a new global optimization approach based on the filled function method for solving box-constrained systems of nonlinear equations. The special properties of optimization problem are employed to construct a novel filled function. The objective function value can be reduced by half in each iteration of our filled function algorithm. Several numerical examples are presented to illustrate the efficiency of the present approach.
- Description: C1
- Description: 2003005618
A novel monotonization transformation for some classes of global optimization problems
- Authors: Bai, Fusheng , Wu, Zhiyou
- Date: 2006
- Type: Text , Journal article
- Relation: Asia-Pacific Journal of Operational Research Vol. 23, no. 3 (Sep 2006), p. 371-392
- Full Text: false
- Reviewed:
- Description: A novel monotonization method is proposed for converting a non-monotone programming problem into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existing convexification and concavification methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.
- Description: C1
- Description: 2003003590