Luo, ZhiQuan
Overview
Works:  39 works in 61 publications in 2 languages and 225 library holdings 

Roles:  Editor, Author 
Classifications:  QA76.9.D32, 005.7 
Publication Timeline
.
Most widely held works by
ZhiQuan Luo
Big data over networks by
Shuguang Cui(
Book
)
7 editions published in 2016 in English and held by 82 WorldCat member libraries worldwide
Utilizing both key mathematical tools and stateoftheart research results, this text explores the principles underpinning largescale information processing over networks and examines the crucial interaction between big data and its associated communication, social and biological networks. Written by experts in the diverse fields of machine learning, optimisation, statistics, signal processing, networking, communications, sociology and biology, this book employs two complementary approaches: first analysing how the underlying network constrains the upperlayer of collaborative big data processing, and second, examining how big data processing may boost performance in various networks. Unifying the broad scope of the book is the rigorous mathematical treatment of the subjects, which is enriched by indepth discussion of future directions and numerous openended problems that conclude each chapter. Readers will be able to master the fundamental principles for dealing with big data over large systems, making it essential reading for graduate students, scientific researchers and industry practitioners alike
7 editions published in 2016 in English and held by 82 WorldCat member libraries worldwide
Utilizing both key mathematical tools and stateoftheart research results, this text explores the principles underpinning largescale information processing over networks and examines the crucial interaction between big data and its associated communication, social and biological networks. Written by experts in the diverse fields of machine learning, optimisation, statistics, signal processing, networking, communications, sociology and biology, this book employs two complementary approaches: first analysing how the underlying network constrains the upperlayer of collaborative big data processing, and second, examining how big data processing may boost performance in various networks. Unifying the broad scope of the book is the rigorous mathematical treatment of the subjects, which is enriched by indepth discussion of future directions and numerous openended problems that conclude each chapter. Readers will be able to master the fundamental principles for dealing with big data over large systems, making it essential reading for graduate students, scientific researchers and industry practitioners alike
New error bounds for the linear complementarity problem by
ZhiQuan Luo(
Book
)
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
When the matrix associated with the LCP is nondegenerate, the new error bound is in fact global. This extends the error bound result [MaP90] for the LCP with a Pmatrix."
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
When the matrix associated with the LCP is nondegenerate, the new error bound is in fact global. This extends the error bound result [MaP90] for the LCP with a Pmatrix."
On the communication complexity of distributed algebraic computation by
ZhiQuan Luo(
Book
)
3 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
WE CONSIDER A SITUATION WHERE TWO PROCESSORS P sub 1 and P sub 2 ar e to evaluate a collection of functions function 1 ..., function 8 of two vector variables x, y, under the assumption that processor P sub 1 (respectively, P sub 2) has access only to the value of the variable x (respectively, y) and the functional form of function 1 ..., function 8. We provide some new bounds on the communication complexity (the amount of information that has to be exchanged between the processors) for this problem. An almost optimal bound is derived for the case of oneway communication when the functions function 1 ..., function 8 are polynomials. We also derive some new lower bounds for the case of twoway communication which improve on earlier bounds by Abelson A 80. As an application, we consider the case where x and y are n x n matrices and f(x, y) is a particular entry of the inverse of x + y. Under certain restriction on the class of allowed communication protocols, we obtain an omega(n squared) lower bound, in contrast to the omega(n) lower bound obtained by applying Abelson's results. Our results are based on certain tools from classical algebraic geometry and field extension theory. (kr)
3 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
WE CONSIDER A SITUATION WHERE TWO PROCESSORS P sub 1 and P sub 2 ar e to evaluate a collection of functions function 1 ..., function 8 of two vector variables x, y, under the assumption that processor P sub 1 (respectively, P sub 2) has access only to the value of the variable x (respectively, y) and the functional form of function 1 ..., function 8. We provide some new bounds on the communication complexity (the amount of information that has to be exchanged between the processors) for this problem. An almost optimal bound is derived for the case of oneway communication when the functions function 1 ..., function 8 are polynomials. We also derive some new lower bounds for the case of twoway communication which improve on earlier bounds by Abelson A 80. As an application, we consider the case where x and y are n x n matrices and f(x, y) is a particular entry of the inverse of x + y. Under certain restriction on the class of allowed communication protocols, we obtain an omega(n squared) lower bound, in contrast to the omega(n) lower bound obtained by applying Abelson's results. Our results are based on certain tools from classical algebraic geometry and field extension theory. (kr)
On the convergence of the affinescaling algorithm by
Paul Tseng(
Book
)
3 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
On the convergence of the coordinate descent method for convex differentiable minimization by
ZhiQuan Luo(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Communication complexity of some problems in distributed computation by
ZhiQuan Luo(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
We also derive several new lower bounds for the class of twoway continuous communication protocols which improve on earlier bounds by Abelson [A80]. We then apply our results to the problems such as solving a system of linear equations, solving a polynomial equation and obtain almost tight lower bounds. In contrast, we show, in both cases, that the lower bounds obtained by applying Abelson's result are far from optimal. We also consider the problem of distributed convex optimization where each processor P[subscript i] is given a convex function f[subscript i] (i=1,2) and they wish to, by exchanging binary messages, approximately minimize the sum f₁ + f₂. We give both lower and upper bounds on the minimum number of bits that have to be exchanged for this problem. Finally, several issues about multiparty communication are addressed."
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
We also derive several new lower bounds for the class of twoway continuous communication protocols which improve on earlier bounds by Abelson [A80]. We then apply our results to the problems such as solving a system of linear equations, solving a polynomial equation and obtain almost tight lower bounds. In contrast, we show, in both cases, that the lower bounds obtained by applying Abelson's result are far from optimal. We also consider the problem of distributed convex optimization where each processor P[subscript i] is given a convex function f[subscript i] (i=1,2) and they wish to, by exchanging binary messages, approximately minimize the sum f₁ + f₂. We give both lower and upper bounds on the minimum number of bits that have to be exchanged for this problem. Finally, several issues about multiparty communication are addressed."
Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem by
Paul Tseng(
Book
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
On the convergence of a matrix splitting algorithm for the symmetric linear complementarity problem by
ZhiQuan Luo(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
On the linear convergence of descent methods for convex essentially smooth minimization by
ZhiQuan Luo(
Book
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Our results do not require that the cost function be strongly convex or that the optimal solution set be bounded. The key to our analysis lies in a new bound for estimating the distance from a point to the optimal solution set."
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Our results do not require that the cost function be strongly convex or that the optimal solution set be bounded. The key to our analysis lies in a new bound for estimating the distance from a point to the optimal solution set."
Xin xing cai xian ji cheng dian lu wei xiu shu ju da quan(
Book
)
1 edition published in 2005 in Chinese and held by 3 WorldCat member libraries worldwide
Ben shu cong wei xiu shi yong jiao du chu fa,Lie chu le 500 yu zhong xing hao ji cheng dian lu de zhu yao zuo yong,Yin jiao gong neng,Ji yi yi zhong ji xing wei li de shi ce dong/ jing(you xin hao/ wu xin hao)Dian ya,Zheng/ fan xiang(zheng xiang ce shi/ fan xiang ce shi)Dui di dian zu shu ju
1 edition published in 2005 in Chinese and held by 3 WorldCat member libraries worldwide
Ben shu cong wei xiu shi yong jiao du chu fa,Lie chu le 500 yu zhong xing hao ji cheng dian lu de zhu yao zuo yong,Yin jiao gong neng,Ji yi yi zhong ji xing wei li de shi ce dong/ jing(you xin hao/ wu xin hao)Dian ya,Zheng/ fan xiang(zheng xiang ce shi/ fan xiang ce shi)Dui di dian zu shu ju
On computing the nested sums and infimal convolutions of convex piecewiselinear functions by
Paul Tseng(
Book
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Data fusion with minimal communication by
ZhiQuan Luo(
Book
)
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
On the communication complexity of solving a polynomial equation by
ZhiQuan Luo(
Book
)
3 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
In a computer network where a set of processors wish to perform some computational task, communication can sometimes become a bottleneck, especially when communication resources are scarce. This is particularly so, in the area of parallel and VLSI computation where communication issues have been studied extensively. In such contexts, it is desirable to design algorithms that require as little information exchange as possible. Problems of minimizing the amount of exchanged information also arise in the context of decentralized signal processing, where each local processor collects some partial data to be processed collectively. In this paper, we study the communication complexity (i. e., the minimum possible amount of information exchange) of some particular computational tasks. Generally speaking, communication complexity depends both on the topology of a computer network and on the nature of the computational task under consideration. In this paper, we ignore the topological issues, by assuming that there are only two processors, say P1 and P2
3 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
In a computer network where a set of processors wish to perform some computational task, communication can sometimes become a bottleneck, especially when communication resources are scarce. This is particularly so, in the area of parallel and VLSI computation where communication issues have been studied extensively. In such contexts, it is desirable to design algorithms that require as little information exchange as possible. Problems of minimizing the amount of exchanged information also arise in the context of decentralized signal processing, where each local processor collects some partial data to be processed collectively. In this paper, we study the communication complexity (i. e., the minimum possible amount of information exchange) of some particular computational tasks. Generally speaking, communication complexity depends both on the topology of a computer network and on the nature of the computational task under consideration. In this paper, we ignore the topological issues, by assuming that there are only two processors, say P1 and P2
Design of optical networks: performance bounds, complexity and algorithms by Mohamed Elsayed Mostafa Saad(
Book
)
1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide
Given a combination of unprotected and dedicated edgedisjoint path (1 + 1) protected connection requests and a finite set of fiber types whose costs reflect an economy of scale, we consider the WDM network design problem of allocating fibers on the links of a multifiber WDM network with wavelength converters at minimum cost, such that all connection requests can be simultaneously routed. It is known that a solution induced by "simply" routing each connection along the shortest path (pair) minimizes the total wavelength mileage, but may not minimize the total fiber cost. We theoretically quantify the increase in fiber cost due to shortest path routing. In particular, we prove that the total cost of a shortest path based solution is guaranteed to lie within a certain factor of the minimum possible cost. We also demonstrate that shortest path routing is asymptotically costoptimal in heavily loaded networks with general topologies, and in large networks with some special topologies, e.g., the ring, the ShuffleNets and the mesh( torus). We extend most of these results to networks with no wavelength conversion and a single fiber type
1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide
Given a combination of unprotected and dedicated edgedisjoint path (1 + 1) protected connection requests and a finite set of fiber types whose costs reflect an economy of scale, we consider the WDM network design problem of allocating fibers on the links of a multifiber WDM network with wavelength converters at minimum cost, such that all connection requests can be simultaneously routed. It is known that a solution induced by "simply" routing each connection along the shortest path (pair) minimizes the total wavelength mileage, but may not minimize the total fiber cost. We theoretically quantify the increase in fiber cost due to shortest path routing. In particular, we prove that the total cost of a shortest path based solution is guaranteed to lie within a certain factor of the minimum possible cost. We also demonstrate that shortest path routing is asymptotically costoptimal in heavily loaded networks with general topologies, and in large networks with some special topologies, e.g., the ring, the ShuffleNets and the mesh( torus). We extend most of these results to networks with no wavelength conversion and a single fiber type
Data fusion and filtering for target tracking and identification by
Lingjie Li(
Book
)
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
This thesis explores two problems in target tracking and identification: (1) & nbsp;robust track state filtering, and (2) & nbsp;decisionlevel identity fusion
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
This thesis explores two problems in target tracking and identification: (1) & nbsp;robust track state filtering, and (2) & nbsp;decisionlevel identity fusion
Blind signal separation by
Jun Lu(
Book
)
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
For the problem of blind separation of convolutively mixed signals, which is also known as blind deconvolution problem, we first propose a time domain method. We cast the separation problem as an optimization problem using a mutual information based criterion and solve it using a sequential quadratic programming (SQP) method. Then, we propose a set of higherorder statistics (HOS) based criteria for blind deconvolution. We also discuss the relationship of our proposed criteria and other HOS based criteria. We then propose a frequency domain HOS based blind channel identification approach. In this approach, we identify the channel frequency response by jointly diagonalizing a set of so called polyspectrum matrices. Finally, we propose a secondorder statistics (SOS) based method for blind channel identification. Assuming the channel inputs are cyclostationary signals, we identify the channel frequency response through the singular value decomposition (SVD) of a cyclic crossspectrum based matrix
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
For the problem of blind separation of convolutively mixed signals, which is also known as blind deconvolution problem, we first propose a time domain method. We cast the separation problem as an optimization problem using a mutual information based criterion and solve it using a sequential quadratic programming (SQP) method. Then, we propose a set of higherorder statistics (HOS) based criteria for blind deconvolution. We also discuss the relationship of our proposed criteria and other HOS based criteria. We then propose a frequency domain HOS based blind channel identification approach. In this approach, we identify the channel frequency response by jointly diagonalizing a set of so called polyspectrum matrices. Finally, we propose a secondorder statistics (SOS) based method for blind channel identification. Assuming the channel inputs are cyclostationary signals, we identify the channel frequency response through the singular value decomposition (SVD) of a cyclic crossspectrum based matrix
Communication complexity of convex optimization by
John N Tsitsiklis(
Book
)
2 editions published in 1986 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 2 WorldCat member libraries worldwide
Mathematical programs with equilibrium constrains by
ZhiQuan Luo(
Book
)
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
Error bounds for quadratic systems by
ZhiQuan Luo(
)
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
On the convergence rate of dual ascent methods for lineary constrained convex minimization by
ZhiQuan Luo(
)
1 edition published in 1993 in English and held by 1 WorldCat member library worldwide
1 edition published in 1993 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Cui, Shuguang Author Editor
 Hero, Alfred O. (Alfred Olivier) 1955 Editor
 Moura, José M. F. 1946 Editor
 Center for Intelligent Control Systems (U.S.)
 Tseng, Paul Honoree Author
 Tsitsiklis, John N. Author
 Massachusetts Institute of Technology Laboratory for Information and Decision Systems
 MINNESOTA UNIV MINNEAPOLIS Dept. of ELECTRICAL AND COMPUTER ENGINEERING
 刘克友
 杨茂廷
Associated Subjects
Big data Computational complexity Computer algorithms Computer network protocols Computer networks Computer networksMathematics Convergence Electronic data processingDistributed processing Linear complementarity problem Linear programming Mathematical optimization Multisensor data fusion Optical communications Probabilities Sensor networks Source separation (Signal processing) System analysisData processing Vector processing (Computer science) Wavelength division multiplexing Wireless communication systems