Changzhi Wu - Academia.edu (original) (raw)
Related Authors
Graduate Center of the City University of New York
Uploads
Papers by Changzhi Wu
We present a new method for the design of the cosine-modulated filter bank with low complexity an... more We present a new method for the design of the cosine-modulated filter bank with low complexity and low delay. The design of such a filter bank is formulated as a nonconvex optimization problem with equality constraints. An iterative scheme is developed to solve this optimization problem. To illustrate the effectiveness of the proposed method, a numerical example is presented. Comparing
Journal of Industrial and Management Optimization, 2009
ABSTRACT
Signal Processing, 2010
In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interferenc... more In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interference (ISI) being exactly zero is formulated as a nonlinear optimization problem with continuous inequality constraints. An iterative scheme is developed for solving this semi-infinite optimization problem, where an improved dual parametrization method is utilized in each iteration of the iterative scheme. Trade-off between robustness against
Applied Mathematics Letters, 2006
In this note, we develop a computational method for solving an optimal control problem which is g... more In this note, we develop a computational method for solving an optimal control problem which is governed by a switched dynamical system with time delay. Our approach is to parameterize the switching instants as a new parameter vector to be optimized. Then, we derive the required gradient of the cost function which is obtained via solving a number of delay differential equations forward in time. On this basis, the optimal control problem can be solved as a mathematical programming problem.
Journal of Industrial and Management Optimization, 2009
ABSTRACT
Signal Processing, 2010
In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interferenc... more In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interference (ISI) being exactly zero is formulated as a nonlinear optimization problem with continuous inequality constraints. An iterative scheme is developed for solving this semi-infinite optimization problem, where an improved dual parametrization method is utilized in each iteration of the iterative scheme. Trade-off between robustness against
Applied Mathematics Letters, 2006
In this note, we develop a computational method for solving an optimal control problem which is g... more In this note, we develop a computational method for solving an optimal control problem which is governed by a switched dynamical system with time delay. Our approach is to parameterize the switching instants as a new parameter vector to be optimized. Then, we derive the required gradient of the cost function which is obtained via solving a number of delay differential equations forward in time. On this basis, the optimal control problem can be solved as a mathematical programming problem.
We present a new method for the design of the cosine-modulated filter bank with low complexity an... more We present a new method for the design of the cosine-modulated filter bank with low complexity and low delay. The design of such a filter bank is formulated as a nonconvex optimization problem with equality constraints. An iterative scheme is developed to solve this optimization problem. To illustrate the effectiveness of the proposed method, a numerical example is presented. Comparing
Journal of Industrial and Management Optimization, 2009
ABSTRACT
Signal Processing, 2010
In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interferenc... more In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interference (ISI) being exactly zero is formulated as a nonlinear optimization problem with continuous inequality constraints. An iterative scheme is developed for solving this semi-infinite optimization problem, where an improved dual parametrization method is utilized in each iteration of the iterative scheme. Trade-off between robustness against
Applied Mathematics Letters, 2006
In this note, we develop a computational method for solving an optimal control problem which is g... more In this note, we develop a computational method for solving an optimal control problem which is governed by a switched dynamical system with time delay. Our approach is to parameterize the switching instants as a new parameter vector to be optimized. Then, we derive the required gradient of the cost function which is obtained via solving a number of delay differential equations forward in time. On this basis, the optimal control problem can be solved as a mathematical programming problem.
Journal of Industrial and Management Optimization, 2009
ABSTRACT
Signal Processing, 2010
In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interferenc... more In this paper, the optimum design of a factorable Nyquist filter with the intersymbol interference (ISI) being exactly zero is formulated as a nonlinear optimization problem with continuous inequality constraints. An iterative scheme is developed for solving this semi-infinite optimization problem, where an improved dual parametrization method is utilized in each iteration of the iterative scheme. Trade-off between robustness against
Applied Mathematics Letters, 2006
In this note, we develop a computational method for solving an optimal control problem which is g... more In this note, we develop a computational method for solving an optimal control problem which is governed by a switched dynamical system with time delay. Our approach is to parameterize the switching instants as a new parameter vector to be optimized. Then, we derive the required gradient of the cost function which is obtained via solving a number of delay differential equations forward in time. On this basis, the optimal control problem can be solved as a mathematical programming problem.