WorldCat Identities

Luo, Zhi-Quan

Overview
Works: 44 works in 74 publications in 3 languages and 320 library holdings
Roles: Editor, Author
Publication Timeline
.
Most widely held works by Zhi-Quan Luo
Big data over networks by Shuguang Cui( Book )

8 editions published in 2016 in English and held by 106 WorldCat member libraries worldwide

Utilising both key mathematical tools and state-of-the-art research results, this text explores the principles underpinning large-scale 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 upper-layer 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 in-depth discussion of future directions and numerous open-ended 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
On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems by J.-L Goffin( Book )

4 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide

Data fusion with minimal communication by Zhi-Quan Luo( Book )

4 editions published between 1991 and 1993 in English and held by 5 WorldCat member libraries worldwide

New error bounds for the linear complementarity problem by Zhi-Quan Luo( Book )

3 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide

Abstract: "Recently [MaS92] it was shown that every nonlinear complementarity problem (NCP) is equivalent to the unconstrained minimization of a certain implicit Lagrangian. In particular, it was shown that this implicit Lagrangian is nonnegative everywhere and its set of zeros coincides with the solution set of the original NCP. In this paper, we consider the linear complementarity problem (LCP), and show that the distance to the solution set of the LCP from any point sufficiently close to the set can be bounded above by the square root of the implicit Lagrangian for the LCP. In other words, the square root of the implicit Lagrangian is a local error bound for the LCP. We also show that this new local error bound is equivalent to a known local error bound [Rob81, LuT92b]
On the communication complexity of distributed algebraic computation by Zhi-Quan 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 one-way communication when the functions function 1 ..., function 8 are polynomials. We also derive some new lower bounds for the case of two-way 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 affine-scaling algorithm by Paul Tseng( Book )

3 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide

Communication complexity of some problems in distributed computation by Zhi-Quan 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 two-way 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 multi-party communication are addressed."
Further complexity analysis of a primal-dual column generation algorithm for convex or quasiconvex feasibility problems by J.-L Goffin( Book )

2 editions published in 1993 in French and English and held by 3 WorldCat member libraries worldwide

On the communication complexity of solving a polynomial equation by Zhi-Quan 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
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
On the computational complexity of the maximum trade problem by David Lorge Parnas( Book )

1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide

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

On the convergence of a matrix splitting algorithm for the symmetric linear complementarity problem by Zhi-Quan Luo( Book )

2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide

On computing the nested sums and infimal convolutions of convex piecewise-linear functions by Paul Tseng( Book )

2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide

On the linear convergence of descent methods for convex essentially smooth minimization by Zhi-Quan 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."
On the convergence of the coordinate descent method for convex differentiable minimization by Zhi-Quan Luo( Book )

2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide

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

An optimum complete orthonormal basis for signal analysis and design by Q Jin( Book )

1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide

Mathematical problems with equilibrium constraints by Zhi-Quan Luo( Book )

1 edition published in 1996 in English and held by 1 WorldCat member library worldwide

Data fusion and filtering for target tracking and identification by Lingjie Li( Book )

1 edition published in 2003 in English and held by 1 WorldCat member library worldwide

This thesis explores two problems in target tracking and identification: (1) & nbsp;robust track state filtering, and (2) & nbsp;decision-level identity fusion
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.65 (from 0.60 for Big data o ... to 0.95 for Xin xing c ...)

Mathematical problems with equilibrium constraints
Alternative Names
Luo, Tom

Luo, Zhi-quan

Languages
Covers