Paul Tseng
| Paul Tseng | |
|---|---|
 |
|
| Born | September 21, 1959 Taiwan |
| Died | Possible drowning |
| Residence | 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 Linear programming Distributed computing Network algorithms |
Paul Tseng was an 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]
Contents |
[edit] Biography
Paul Tseng was born September 21, 1959 in Hsin-Chu in 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]
[edit] Research
Tseng made many contributions to mathematical optimization, publishing many articles and helping to develop quality software that has been widely used. Paul Tseng has published over 120 papers in optimization and had close collaborations with several colleagues, including Dimitri Bertsekas and Tom Luo.
Tseng's research subjects include:
- Efficient algorithms for structured convex programs and network flow problems,
- Complexity analysis of interior point methods for linear programming,
- Parallel and distributed computing,
- Error bounds and convergence analysis of iterative algorithms for optimization problems and variational inequalities,
- Interior point methods and semidefinite relaxations for hard quadratic and matrix optimization problems, and
- Applications of large scale optimization techniques in signal processing and machine learning.[4]
In his research, Tseng provided 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 matching (with propensity scores). 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 his honor were held at the University of Washington and at Fudan University in Shanghai.[10]
[edit] Travels and disappearance
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 of 2009, Paul Tseng went missing while kayaking in the Yantze river near Lijiang, in Yunnan province of China and is now presumed dead.[11]
[edit] See also
[edit] Notes
- ^ www.mathopt.org/Optima-Issues/optima82.pdf
- ^ www.mathopt.org/Optima-Issues/optima82.pdf
- ^ Homepage of Tseng
- ^ Recent papers of Paul Tseng
- ^ [1] Zhi-quan Luot, 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
- ^ [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.
- ^ [3] Paul Tseng, Zhi-Quan Luo: On the convergence of the affine-scaling algorithm. Math. Program. 56: 301-319 (1992)
- ^ RELAX4 from NEOS
- ^ ERELAXG
- ^ http://www.math.washington.edu/newsletter/2010/tseng.php
- ^ http://www.math.washington.edu/newsletter/2010/tseng.php
