A filled function method for constrained global optimization
- Authors: Wu, Zhiyou , Bai, Fusheng , Lee, Heung , Yang, Yongjian
- Date: 2007
- Type: Text , Journal article
- Relation: Journal of Global Optimization Vol. 39, no. 4 (2007), p. 495-507
- Full Text: false
- Reviewed:
- Description: In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems. © 2007 Springer Science+Business Media, Inc.
- Description: C1
- Description: 2003005513
A filled function method for constrained nonlinear equations
- Authors: Bai, Fusheng , Mammadov, Musa , Wu, Zhiyou , Yang, Yongjian
- Date: 2008
- Type: Text , Journal article
- Relation: Pacific Journal of Optimization Vol. 4, no. 1 (Jan 2008), p. 9-18
- Full Text: false
- Reviewed:
- Description: We consider the problem of solving a constrained system of nonlinear equations. After reformulating the system into an equivalent constrained global optimization problems, we construct a filled function based on a special property of the reformulated problem. A filled function method is then proposed to solve the constrained system of nonlinear equations. Some numerical examples are presented to illustrate the usefulness of the present techniques.
- Description: C1
A filled function method for constrained nonlinear integer programming
- Authors: Yang, Yongjian , Wu, Zhiyou , Bai, Fusheng
- Date: 2008
- Type: Text , Journal article
- Relation: Journal of Industrial and Management Optimization Vol. 4, no. 2 (May 2008), p. 353-362
- Full Text:
- Reviewed:
- Description: A filled function method is presented in this paper to solve constrained nonlinear integer programming problems. It is shown that for a given non-global local minimizer, a better local minimizer can be obtained by local search staring from an improved initial point which is obtained by locally solving a box-constrained integer programming problem. Several illustrative numerical examples are reported to show the efficiency of the present method.
- Description: C1
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
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.
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.
Global optimality conditions and optimization methods for quadratic assignment problems
- Authors: Wu, Zhiyou , Yang, Yongjian , Bai, Fusheng , Tian, Jing
- Date: 2012
- Type: Text , Journal article
- Relation: Applied Mathematics and Computation Vol. 218, no. 11 (2012), p. 6214-6231
- Full Text:
- Reviewed:
- Description: In this paper some global optimality conditions for general quadratic {0, 1} programming problems with linear equality constraints are discussed and then some global optimality conditions for quadratic assignment problems (QAP) are presented. A local optimization method for (QAP) is derived according to the necessary global optimality conditions. A global optimization method for (QAP) is presented by combining the sufficient global optimality conditions, the local optimization method and some auxiliary functions. Some numerical examples are given to illustrate the efficiency of the given optimization methods. © 2011 Elsevier Inc. All rights reserved.