Li-Zhi Liao

Li-Zhi Liao

Auto-generated profile, based on publicly available information

Li-Zhi Liao

Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2001 in Applied Mathematics & Optimization
Verified
Journal Article
Closed access
PDF file
YDY. -H. Dai
Y. -H. Dai
LLL. -Z. Liao
L. -Z. Liao

1 March 2002 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
BHBingsheng He
Bingsheng He
LLLi-Zhi Liao
Li-Zhi Liao
DHDeren Han
Deren Han
HYHai Yang
Hai Yang

1 January 2002 in IMA Journal of Numerical Analysis
Verified
Journal Article
Closed access
PDF file
YDYu‐Hong Dai
Yu‐Hong Dai
LLLi‐Zhi Liao
Li‐Zhi Liao
Combined with non‐monotone line search, the Barzilai and Borwein (BB) gradient method has been successfully extended for solving unconstrained optimization problems and is competitive with conjugate gradient methods. In this paper, we establish the R‐linear convergence of the BB method for any‐dimensional strongly convex quadratics. One corollary of this result is that the BB method is also locally R‐linear convergent for general objective functions, and hence the stepsize in the BB method will always be accepted by the non‐monotone line search when the iterate is close to the solution.

1 January 2002 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
BHB. S. He
B. S. He
LLL. Z. Liao
L. Z. Liao

1 June 1991 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
LLL.-Z. Liao
L.-Z. Liao
CSC.A. Shoemaker
C.A. Shoemaker
The conditions under which the original differential dynamic programming (DDP) algorithm can be expected to converge are investigated and modifications in the algorithm to improve convergence properties are proposed. Quadratic convergence of DDP requires that the stagewise Hessian matrices computed in the algorithm be positive definite. Three procedures for modifying the stagewise Hessian matrices to guarantee convergence for situations in which the stagewise Hessian matrices are not positive definite are proposed. One of the procedures (an active shift) converges quadratically. The computational requirements for DDP with and without the shift procedures are presented, and the impact of the ratio of state variable dimension to control variable dimension on the relative efficiency of the different shift procedures is discussed. Numerical results for a series of problems, including one with 16 state variables and 200 time steps, are presented. The most robust shift procedure is an adaptive shift that utilizes a constant shift followed by an active shift.

1 May 2001 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
SWS. L. Wang
S. L. Wang
LLL. Z. Liao
L. Z. Liao