Tseng, Paul
Overview
Works:  64 works in 114 publications in 2 languages and 162 library holdings 

Genres:  Case studies 
Roles:  Author, Originator, Honoree 
Classifications:  TJ217.5, 658.049 
Publication Timeline
.
Most widely held works by
Paul Tseng
Case studies on international business by
Paul Tseng(
Book
)
5 editions published between 1999 and 2003 in English and Chinese and held by 8 WorldCat member libraries worldwide
5 editions published between 1999 and 2003 in English and Chinese and held by 8 WorldCat member libraries worldwide
Applications of a splitting algorithm to decomposition in convex programming and variational inequalities by
Paul Tseng(
Book
)
4 editions published between 1988 and 1989 in English and held by 6 WorldCat member libraries worldwide
4 editions published between 1988 and 1989 in English and held by 6 WorldCat member libraries worldwide
A very simple polynomialtime algorithm for linear programming by
Paul Tseng(
Book
)
4 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
This document proposes a polynomialtime algorithm for linear programming. This algorithm augments the objective by a logarithmic penalty function and then solves a sequence of quadratic approximations of this program. This algorithms has a complexity of iterations and arithmetic operations, where m is a number of variables and L is the size of the problem encoding in binary. This algorithm does not require knowledge of the optimal value and generates a sequence of primal (Dual) feasible solutions that converges to an optimal primal (dual) solution (the latter property provides a particularly simple stopping criterion). Moreover, this algorithm is simple and intuitive, both in the description and in the analysis  in contrast to existing polynomialtime algorithms. It works exclusively in the original space. Keywords: Karmarkar methods; Quadratic approximation; Logarithmic penalty functions. (KR)
4 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
This document proposes a polynomialtime algorithm for linear programming. This algorithm augments the objective by a logarithmic penalty function and then solves a sequence of quadratic approximations of this program. This algorithms has a complexity of iterations and arithmetic operations, where m is a number of variables and L is the size of the problem encoding in binary. This algorithm does not require knowledge of the optimal value and generates a sequence of primal (Dual) feasible solutions that converges to an optimal primal (dual) solution (the latter property provides a particularly simple stopping criterion). Moreover, this algorithm is simple and intuitive, both in the description and in the analysis  in contrast to existing polynomialtime algorithms. It works exclusively in the original space. Keywords: Karmarkar methods; Quadratic approximation; Logarithmic penalty functions. (KR)
Convergence of asynchronous matrix iterations subject to diagonal dominance by
Paul Tseng(
Book
)
3 editions published between 1988 and 1989 in English and held by 5 WorldCat member libraries worldwide
3 editions published between 1988 and 1989 in English and held by 5 WorldCat member libraries worldwide
Coordinate ascent for maximizing nondifferentiable concave functions by
Paul Tseng(
Book
)
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
A simple polynomialtime algorithm for convex quadratic programming by
Paul Tseng(
Book
)
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
RELAXTIII : a new and improved version of the RELAX code by
Dimitri P Bertsekas(
Book
)
3 editions published between 1989 and 1990 in English and held by 4 WorldCat member libraries worldwide
3 editions published between 1989 and 1990 in English and held by 4 WorldCat member libraries worldwide
Partially asychronous, parallel algorithms for network flow and other problems by
Paul Tseng(
Book
)
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
On the rate of convergence of a partially asynchronous gradient projection algorithm by
Paul Tseng(
Book
)
3 editions published between 1989 and 1990 in English and held by 4 WorldCat member libraries worldwide
3 editions published between 1989 and 1990 in English and held by 4 WorldCat member libraries worldwide
Partial proximal minimization algorithms for convex programming by
Dimitri P Bertsekas(
Book
)
3 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
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
Relaxation methods for problems with strictly convex separable costs and linear constraints by
Paul Tseng(
Book
)
3 editions published between 1986 and 1987 in English and held by 4 WorldCat member libraries worldwide
3 editions published between 1986 and 1987 in English and held by 4 WorldCat member libraries worldwide
On the convergence of the exponential multiplier method for convex programming 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
Relaxation methods for minimum cost ordinary and generalized network flow problems by
Dimitri P Bertsekas(
Book
)
3 editions published between 1983 and 1985 in English and held by 3 WorldCat member libraries worldwide
3 editions published between 1983 and 1985 in English and held by 3 WorldCat member libraries worldwide
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function by
Paul Tseng(
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
Abstract: "Consider the problem of minimizing, over a polyhedral set, the composition of an affine mapping with a strictly convex essentially smooth function. There exist many wellknown descent methods for solving this problem (or special cases of), such as the gradient projection algorithm of Goldstein and Levitin and Polyak, a matrix splitting algorithm using regular splitting, and the coordinate descent method, whose rate of convergence remain poorly understood. Rate of convergence analysis for these methods typically require restrictive assumptions such as the cost function be strongly convex. We show, under very mild assumptions on the cost function, that the aforementioned algorithms converge at least linearly
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Consider the problem of minimizing, over a polyhedral set, the composition of an affine mapping with a strictly convex essentially smooth function. There exist many wellknown descent methods for solving this problem (or special cases of), such as the gradient projection algorithm of Goldstein and Levitin and Polyak, a matrix splitting algorithm using regular splitting, and the coordinate descent method, whose rate of convergence remain poorly understood. Rate of convergence analysis for these methods typically require restrictive assumptions such as the cost function be strongly convex. We show, under very mild assumptions on the cost function, that the aforementioned algorithms converge at least linearly
Successive projection under a quasicyclic order by
Paul Tseng(
Book
)
3 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
A classical method for finding a point in the intersection of a finite collection of closed convex sets is the successive projection method. It is wellknown that this method is convergent if each convex sets is chosen for projection in a cyclical manner. In this note we show that this method is still convergent if the length of the cycle grows without bound, provided that the growth is not too fast. Our argument is based on an interesting application of the CauchySchwartz inequality
3 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
A classical method for finding a point in the intersection of a finite collection of closed convex sets is the successive projection method. It is wellknown that this method is convergent if each convex sets is chosen for projection in a cyclical manner. In this note we show that this method is still convergent if the length of the cycle grows without bound, provided that the growth is not too fast. Our argument is based on an interesting application of the CauchySchwartz inequality
Polynomial time algorithms for finite horizon, stationary Markov decision processes by
Paul Tseng(
Book
)
2 editions published in 1988 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1988 in English and held by 3 WorldCat member libraries worldwide
A decomposition algorithm for convex differentiable minimization by
Paul Tseng(
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
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Concave functions Convergence Convex programming International business enterprises International business enterprisesManagement Jacobi method Lagrangian functions Linear programming Markov processes Mathematical optimization MatricesComputer programs Neural computers Polynomials Relaxation methods (Mathematics) System analysis