WorldCat Identities

Tseng, Paul

Overview
Works: 53 works in 97 publications in 2 languages and 144 library holdings
Genres: Case studies 
Roles: Author, Originator
Classifications: TJ217.5, 658.049
Publication Timeline
.
Most widely held works by Paul Tseng
Discourse analysis in Chinese composition = Pian zhang jie gou xue by Manming Chen( Book )

2 editions published between 2010 and 2011 in Chinese and English and held by 17 WorldCat member libraries worldwide

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

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

A very simple polynomial-time 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 polynomial-time 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 polynomial-time algorithms. It works exclusively in the original space. Keywords: Karmarkar methods; Quadratic approximation; Logarithmic penalty functions. (KR)
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

RELAXT-III : 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

A simple polynomial-time algorithm for convex quadratic programming by Paul Tseng( Book )

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

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

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

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

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

Relaxation method for large scale linear programming using decomposition by Paul Tseng( Book )

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

Successive projection under a quasi-cyclic 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 well-known 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 Cauchy-Schwartz inequality
A path-following algorithm for linear programming using quadratic and logarithmic penalty 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."
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

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 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

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

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.69 (from 0.57 for Convergenc ... to 0.85 for Case studi ...)

Alternative Names
Tseng, P.

Languages