D-Index & Metrics Best Publications

Paul Tseng

University of Washington
United States

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Mathematics D-index 62 Citations 16,195 121 World Ranking 331 National Ranking 185

Computer Science D-index 62 Citations 16,142 116 World Ranking 1848 National Ranking 1008

Overview

What are the main themes of his work throughout his whole career to date

In his study, Dykstra's projection algorithm, Parallelizable manifold and Coordinate descent is strongly linked to Algorithm, which falls under the umbrella field of Theory of computation. He integrates Dykstra's projection algorithm with Convex set in his study. His Parallelizable manifold study frequently draws parallels with other fields, such as Algorithm. He integrates many fields, such as Coordinate descent and Convex optimization, in his works. Set (abstract data type) and Path (computing) are all intertwined in Programming language research. Paul Tseng frequently studies issues relating to Programming language and Set (abstract data type). Mathematical optimization is closely attributed to Flow network in his study. As part of his studies on Flow network, he often connects relevant subjects like Mathematical optimization. His studies link Flow (mathematics) with Geometry.

Paul Tseng most often published in these fields:

Algorithm (77.78%)
Mathematical optimization (77.78%)
Geometry (66.67%)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Convergence of a block coordinate descent method for nondifferentiable minimization

P. Tseng.
Journal of Optimization Theory and Applications (2001)

2286 Citations

A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings

Paul Tseng.
Siam Journal on Control and Optimization (2000)

1131 Citations

A coordinate gradient descent method for nonsmooth separable minimization

Paul Tseng;Sangwoon Yun.
Mathematical Programming (2008)

1079 Citations

Applications of splitting algorithm to decomposition in convex programming and variational inequalities

Paul Tseng.
Siam Journal on Control and Optimization (1991)

675 Citations

On the convergence of the coordinate descent method for convex differentiable minimization

Z. Q. Luo;P. Tseng.
Journal of Optimization Theory and Applications (1992)

611 Citations

Smoothing Functions for Second-Order-Cone Complementarity Problems

Masao Fukushima;Zhi-Quan Luo;Paul Tseng.
Siam Journal on Optimization (2002)

458 Citations

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

Maryam Fazel;Ting Kei Pong;Defeng Sun;Paul Tseng.
SIAM Journal on Matrix Analysis and Applications (2013)

455 Citations

Error bounds and convergence analysis of feasible descent methods: a general approach

Zhi Quan Luo;Paul Tseng.
Annals of Operations Research (1993)

433 Citations

Modified Projection-Type Methods for Monotone Variational Inequalities

Michael V. Solodov;Paul Tseng.
Siam Journal on Control and Optimization (1996)

392 Citations

Approximation accuracy, gradient methods, and error bound for structured convex optimization

Paul Tseng.
Mathematical Programming (2010)

314 Citations

If you think any of the details on this page are incorrect, let us know.

Frequent Co-Authors

External Links

Personal Website for Paul Tseng