Paul Tseng

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Paul Tseng
Paul Tseng1.jpg
Born (1959-09-21)September 21, 1959
Hsinchu, Taiwan
Died Possible drowning
Residence United States
Citizenship Canada
United States
Fields Optimization, Mathematics, Network
Institutions University of British Columbia
Massachusetts Institute of Technology
University of Washington
Alma mater Queen's University
Massachusetts Institute of Technology
Known for

Large-scale optimization

Convex optimization
Linear programming
Distributed computing
Network algorithms

Paul Tseng was a Taiwanese-born American and Canadian applied mathematician and a professor at the Department of Mathematics at the University of Washington, in Seattle, Washington. Tseng was recognized by his peers to be one of the leading optimization researchers of his generation.[1] Paul Tseng went missing while kayaking in the Yangtze River in the Yunnan province of China and is presumed dead.[2]

Biography[edit]

Paul Tseng was born September 21, 1959 in Hsinchu, Taiwan. In December 1970, Tseng's family moved to Vancouver, Canada. Tseng received his B.Sc. from Queen's University in 1981 and his Ph.D. from Massachusetts Institute of Technology in 1986. In 1990 Tseng moved to the University of Washington's Department of Mathematics. Tseng has conducted research primarily in continuous optimization and secondarily in discrete optimization and distributed computation.[3]

Research[edit]

Tseng made many contributions to mathematical optimization, publishing many articles and helping to develop quality software that has been widely used. He published over 120 papers in optimization and had close collaborations with several colleagues, including Dimitri Bertsekas and Tom Luo.

Tseng's research subjects include:

In his research, Tseng gave a new proof for the sharpest complexity result for path-following interior-point methods for linear programming.[5] Furthermore, together with Tom Luo, he resolved a long-standing open question on the convergence of matrix splitting algorithms for linear complementarity problems and affine variational inequalities.[6] Tseng was the first to establish the convergence of the affine scaling algorithm for linear programming in the presence of degeneracy.[7]

Tseng has coauthored (with his Ph.D. advisor, Dimitri Bertsekas) a publicly available network optimization program, called RELAX,[8] which has been widely used in industry and academia for research purposes. This software has been used by statisticians like Paul R. Rosenbaum and Donald Rubin in their work on propensity score matching. Tseng's software for matching has similarly been used in nonparametric statistics to implement exact tests. Tseng has also developed a program called ERELAXG,[9] for network optimization problems with gains. In 2010 conferences in his honor were held at the University of Washington and at Fudan University in Shanghai.[10] Tseng's personal web page[11] can be accessed in the exact state it was at the time of his disappearance, and contains many of his writings.

Travels and disappearance[edit]

Paul Tseng was an ardent bicyclist, kayaker and backpacker. He took many adventurous trips, including kayak tours along the Mekong, the Danube, the Nile and the Amazon. On August 13, 2009, Paul Tseng went missing while kayaking in the Yantze river near Lijiang, in Yunnan province of China and is now presumed dead.[12]

See also[edit]

Notes[edit]

  1. ^ http://www.mathopt.org/Optima-Issues/optima82.pdf
  2. ^ http://www.mathopt.org/Optima-Issues/optima82.pdf
  3. ^ Homepage of Tseng
  4. ^ Recent papers of Paul Tseng
  5. ^ [1] Zhi-quan Luo, Paul Tseng : On the Convergence of a Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem*,SIAM Journal on Control and Optimization archive Volume 29, Issue 5 (September 1991) table of contents Pages: 1037 - 1060 Year of Publication: 1991
  6. ^ [2] Luo, Z.-Q. and Tseng, P., Error bounds and the convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2 (1992), 43-54.
  7. ^ [3] Paul Tseng, Zhi-Quan Luo: On the convergence of the affine-scaling algorithm. Math. Program. 56: 301-319 (1992)
  8. ^ RELAX4 from NEOS
  9. ^ ERELAXG
  10. ^ http://www.math.washington.edu/newsletter/2010/tseng.php
  11. ^ http://www.mit.edu/~dimitrib/PTseng/personal.html
  12. ^ http://www.math.washington.edu/newsletter/2010/tseng.php

External links[edit]