Zhi Guo Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhi Guo Feng has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ka Fai Cedric Yiu
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China
4 shared publications - Kok Lay Teo
School of Mathematical Sciences, Sunway University, Bandar Sunway, Selangor Darul Ehsan, Malaysia
4 shared publications - Volker Rehbock
Department of Mathematics and Statistics, Curtin University, Perth, Australia
3 shared publications - Antonio Cantoni
Department of Electrical, Electronic and Computer Engineering, University of Western Australia, Crawley, WA 6009 Australia
1 shared publication - Bin Li
School of Electrical Engineering and Information, Sichuan University, Chengdu, China
1 shared publication - Hai Huyen Dam
Curtin University
1 shared publication
Latest Publications
- 19 August 2017
- Published by Springer Nature in Optimization Letters
- Vol. 12 (6) , 1373-1386
A reduced complexity zero-forcing beamformer design for multiuser MIMO systems
- 19 August 2017
- Published by Springer Nature in Optimization Letters
- Vol. 12 (6) , 1373-1386
A reduced complexity zero-forcing beamformer design for multiuser MIMO systems
- 15 March 2014
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 164 (1) , 316-341
Performance Limit of Broadband Beamformer Designs in Space and Frequency
- 15 March 2014
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 164 (1) , 316-341
Performance Limit of Broadband Beamformer Designs in Space and Frequency
- Open Access
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 10 (2) , 557-566
Manifold relaxations for integer programming
In this paper, the integer programming problem is studied. We introduce the notion of integer basis and show that a given integer set can be converted into a fixed number of linear combinations of the basis elements. By employing the Stiefel manifold and optimal control theory, the combinatorial optimization problem can be converted into a continuous optimization problem over the continuous Stiefel manifold. As a result, gradient descent methods can be applied to find the optimal integer solution. We demonstrate by numerical examples that this approach can obtain good solutions. Furthermore, this method gives new insights into continuous relaxation for solving integer programming problems.Department of Applied Mathematic
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 10 (2) , 557-566
Open AccessManifold relaxations for integer programming
In this paper, the integer programming problem is studied. We introduce the notion of integer basis and show that a given integer set can be converted into a fixed number of linear combinations of the basis elements. By employing the Stiefel manifold and optimal control theory, the combinatorial optimization problem can be converted into a continuous optimization problem over the continuous Stiefel manifold. As a result, gradient descent methods can be applied to find the optimal integer solution. We demonstrate by numerical examples that this approach can obtain good solutions. Furthermore, this method gives new insights into continuous relaxation for solving integer programming problems.Department of Applied Mathematic
- 2 April 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 689-705
A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
In this paper, we consider a class of optimal parameter selection problems with continuous inequality constraints. By introducing a smoothing parameter, we formulate a sequence of KKT (Karush-Kuhn-Tucker) systems of this problem and then transform it into a system of constrained nonlinear equations. Then, the first- and second-order gradients formulae of the cost functional and the constraints are derived. On this basis, a smoothing projected Newton-type algorithm is developed to solving this system of nonlinear equations. To illustrate the effectiveness of the proposed method, some numerical results are solved and presented.
- 2 April 2013
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 28 (4) , 689-705
A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
In this paper, we consider a class of optimal parameter selection problems with continuous inequality constraints. By introducing a smoothing parameter, we formulate a sequence of KKT (Karush-Kuhn-Tucker) systems of this problem and then transform it into a system of constrained nonlinear equations. Then, the first- and second-order gradients formulae of the cost functional and the constraints are derived. On this basis, a smoothing projected Newton-type algorithm is developed to solving this system of nonlinear equations. To illustrate the effectiveness of the proposed method, some numerical results are solved and presented.
- Open Access
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 15 (4) , 1055-1069
Feature extraction of the patterned textile with deformations via optimal control theory
In handling textile materials, deformation is very common and is unavoidable. When the fabrics are dispatched for further feature extractions, it's necessary to recover the original shape for comparison with a standard template. This recovery problem is investigated in this paper. By introducing a set of recovered functions, the problem is formulated as a combined optimal control and optimal parameter selection problem, governed by the dynamical system of a set of two-dimensional control functions. After parameterization of the control functions, the problem is transformed into a nonlinear optimization problem, where gradient based optimization methods can be applied. We also analyze the convergence of the parameterization method. Several numerical examples are used to demonstrate the method.
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 15 (4) , 1055-1069
Open AccessFeature extraction of the patterned textile with deformations via optimal control theory
In handling textile materials, deformation is very common and is unavoidable. When the fabrics are dispatched for further feature extractions, it's necessary to recover the original shape for comparison with a standard template. This recovery problem is investigated in this paper. By introducing a set of recovered functions, the problem is formulated as a combined optimal control and optimal parameter selection problem, governed by the dynamical system of a set of two-dimensional control functions. After parameterization of the control functions, the problem is transformed into a nonlinear optimization problem, where gradient based optimization methods can be applied. We also analyze the convergence of the parameterization method. Several numerical examples are used to demonstrate the method.
- 5 May 2010
- Published by Springer Nature
- p. 241-258
Optimal Feedback Control for Stochastic Impulsive Linear Systems Subject to Poisson Processes
- 5 May 2010
- Published by Springer Nature
- p. 241-258
Optimal Feedback Control for Stochastic Impulsive Linear Systems Subject to Poisson Processes
- 2 June 2009
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 30 (6) , 585-593
A discrete filled function method for the optimal control of switched systems in discrete time
In this paper, we consider the optimal control problem of discrete‐time switched systems. This problem is formulated as an optimization problem involving both continuous and discrete‐valued variables. It can be transformed into a discrete optimization problem. A metric in the space of switching sequences is introduced and an appropriate discrete filled function is constructed. Then, an algorithm that combines the discrete filled function method and a descent method is developed for solving this problem. For illustration, some numerical examples are solved. Copyright © 2009 John Wiley & Sons, Ltd.
- 2 June 2009
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 30 (6) , 585-593
A discrete filled function method for the optimal control of switched systems in discrete time
In this paper, we consider the optimal control problem of discrete‐time switched systems. This problem is formulated as an optimization problem involving both continuous and discrete‐valued variables. It can be transformed into a discrete optimization problem. A metric in the space of switching sequences is introduced and an appropriate discrete filled function is constructed. Then, an algorithm that combines the discrete filled function method and a descent method is developed for solving this problem. For illustration, some numerical examples are solved. Copyright © 2009 John Wiley & Sons, Ltd.
- Open Access
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 5 (1) , 141-151
A smoothing approach for semi-infinite programming with projected Newton-type algorithm
In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming problems. The infinite constraints are replaced by an equivalent nonsmooth function which is then approximated by a smoothing function. The KKT system is formulated as a nonsmooth equation. We then apply the projected Newton-type algorithm to solve this equation and show that the accumulation point satisfies the KKT system. Some numerical results are presented for illustration.
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 5 (1) , 141-151
Open AccessA smoothing approach for semi-infinite programming with projected Newton-type algorithm
In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming problems. The infinite constraints are replaced by an equivalent nonsmooth function which is then approximated by a smoothing function. The KKT system is formulated as a nonsmooth equation. We then apply the projected Newton-type algorithm to solve this equation and show that the accumulation point satisfies the KKT system. Some numerical results are presented for illustration.
- 7 March 2008
- Published by Elsevier in Automatica
- Vol. 44 (5) , 1295-1303
Hybrid method for a general optimal sensor scheduling problem in discrete time
- 7 March 2008
- Published by Elsevier in Automatica
- Vol. 44 (5) , 1295-1303
Hybrid method for a general optimal sensor scheduling problem in discrete time