Paul Tseng | Academic Influence

Paul Tseng's AcademicInfluence.com Rankings

Paul Tseng

Mathematics

#3187

World Rank

#4760

Historical Rank

#1198

USA Rank

Measure Theory

#1341

World Rank

#1688

Historical Rank

#472

USA Rank

mathematics Degrees

Download Badge

Mathematics

Paul Tseng's Degrees

PhD Mathematics University of California, Berkeley
Masters Mathematics University of California, Berkeley

Why Is Paul Tseng Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Paul Tseng was a Chinese-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. On August 13, 2009, Paul Tseng went missing while kayaking in the Jinsha River in the Yunnan province of China and is presumed dead.

(See a Problem?)

Paul Tseng's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization (2001) (1855)
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings (2000) (947)
A coordinate gradient descent method for nonsmooth separable minimization (2008) (799)
On the convergence of the coordinate descent method for convex differentiable minimization (1992) (563)
Applications of splitting algorithm to decomposition in convex programming and variational inequalities (1991) (495)
Hankel Matrix Rank Minimization with Applications to System Identification and Realization (2013) (466)
Error bounds and convergence analysis of feasible descent methods: a general approach (1993) (437)
Smoothing Functions for Second-Order-Cone Complementarity Problems (2002) (398)
Modified Projection-Type Methods for Monotone Variational Inequalities (1996) (303)
Approximation accuracy, gradient methods, and error bound for structured convex optimization (2010) (247)
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints (2007) (243)
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning (2010) (229)
On the linear convergence of descent methods for convex essentially smooth minimization (1992) (222)
Second-Order Cone Programming Relaxation of Sensor Network Localization (2007) (222)
Robust wavelet denoising (2001) (216)
On linear convergence of iterative methods for the variational inequality problem (1995) (208)
Nearest q-Flat to m Points (2000) (205)
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems (1988) (202)
Block Coordinate Relaxation Methods for Nonparametric Wavelet Denoising (2000) (202)
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (2005) (194)
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem (1992) (193)
On the convergence of the exponential multiplier method for convex programming (1993) (187)
An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule (1998) (174)
Block-Coordinate Gradient Descent Method for Linearly Constrained Nonsmooth Separable Optimization (2009) (162)
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities (1997) (147)
Optimal Communication Algorithms for Hypercubes (1991) (145)
Growth behavior of a class of merit functions for the nonlinear complementarity problem (1996) (143)
Statistical Data Analysis Based on the L1-Norm and Related Methods (2002) (139)
Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (1990) (135)
Non-Interior continuation methods for solving semidefinite complementarity problems (2003) (126)
Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints (2011) (126)
Analysis of nonsmooth vector-valued functions associated with second-order cones (2004) (120)
Relaxation methods for network flow problems with convex arc costs (1987) (118)
RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems (1994) (115)
Exact Regularization of Convex Programs (2007) (114)
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints (2002) (114)
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems (2003) (110)
Merit functions for semi-definite complemetarity problems (1998) (98)
Fortified-Descent Simplicial Search Method: A General Approach (1999) (94)
Solving H-horizon, stationary Markov decision problems in time proportional to log(H) (1990) (92)
Dual coordinate ascent methods for non-strictly convex minimization (1993) (90)
Partially asynchronous, parallel algorithms for network flow and other problems (1990) (88)
Dual ascent methods for problems with strictly convex costs and linear constraints: a unified approach (1990) (85)
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation (2003) (85)
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization (1993) (83)
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties (2007) (78)
The relax codes for linear minimum cost network flow problems (1988) (76)
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm (1991) (75)
Objective-derivative-free methods for constrained optimization (2002) (74)
Control perspectives on numerical algorithms and matrix problems (2008) (73)
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (2010) (72)
Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search (2002) (70)
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization (2001) (66)
Analysis Of A Non-Interior Continuation Method Based On Chen-Mangasarian Smoothing Functions For Com (1998) (65)
Error Bounds and Superlinear Convergence Analysis of Some Newton-Type Methods in Optimization (2000) (65)
A Unified Analysis of Hoffman's Bound via Fenchel Duality (1996) (64)
Relaxation methods for problems with strictly convex separable costs and linear constraints (1987) (64)
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization (2002) (61)
Partial Proximal Minimization Algorithms for Convex Pprogramming (1994) (61)
Block coordinate relaxation methods for nonparamatric signal denoising (1998) (59)
Coordinate ascent for maximizing nondifferentiable concave functions (1988) (59)
On the convergence of a matrix splitting algorithm for the symmetric monotone linear complementarity problem (1991) (56)
Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities (2000) (56)
Bounded Linear Regularity, Strong CHIP, and CHIP are Distinct Properties (2000) (54)
An Infeasible Path-Following Method for Monotone Complementarity Problems (1997) (52)
An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods (2004) (52)
Automatic Smoothing With Wavelets for a Wide Class of Distributions (2004) (51)
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach (1996) (46)
(Robust) Edge-based semidefinite programming relaxation of sensor network localization (2011) (46)
On the convergence of the affine-scaling algorithm (1992) (44)
Block coordinate relaxation methods for nonparametric signal denoising with wavelet dictionaries (2000) (43)
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (1991) (42)
AMlet, RAMlet, and GAMlet: Automatic Nonlinear Fitting of Additive Models, Robust and Generalized, With Wavelets (2004) (42)
On the Convergence of the Products of Firmly Nonexpansive Mappings (1992) (41)
Perturbation Analysis of a Condition Number for Linear Systems (1994) (37)
Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise (2009) (36)
Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp ∗ (1998) (35)
Incrementally Updated Gradient Methods for Constrained and Regularized Optimization (2014) (35)
Some convex programs without a duality gap (2008) (31)
An ε-relaxation method for separable convex cost generalized network flow problems (2000) (28)
Efficient computation of multiple solutions in quasibrittle fracture analysis (2003) (28)
An ε-Relaxation Method for Separable Convex Cost Network Flow Problems (1997) (28)
Density Estimation by Total Variation Penalized Likelihood Driven by the Sparsity ℓ1 Information Criterion (2010) (26)
Set Intersection Theorems and Existence of Optimal Solutions (2007) (26)
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (2011) (25)
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization (2002) (25)
On the Statistical Analysis of Smoothing by Maximizing Dirty Markov Random Field Posterior Distributions (2004) (25)
Relaxation methods for monotropic programs (1990) (25)
Relaxation Methods for Linear Programs (1987) (25)
On almost smooth functions and piecewise smooth functions (2007) (24)
Decomposition algorithm for convex differentiable minimization (1991) (24)
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set (1993) (23)
Co-NP-completeness of some matrix classification problems (2000) (22)
On a global projection-type error bound for the linear complementarity problem (1997) (22)
A first-order interior-point method for linearly constrained smooth optimization (2011) (22)
Global linear convergence of a path-following algorithm for some monotone variational inequality problems (1992) (21)
On the rate of convergence of a distributed asynchronous routing algorithm (1994) (20)
On a global error bound for a class of monotone affine variational inequality problems (1992) (20)
RELAX: a computer code for minimum cost network flow problems (1985) (19)
Convergence Properties of Dikin’s Affine Scaling Algorithm for Nonconvex Quadratic Minimization (2004) (19)
Convex Relaxations of the Weighted Maxmin Dispersion Problem (2013) (18)
Existence of Global Minima for Constrained Optimization (2006) (18)
A decomposition property for a class of square matrices (1991) (18)
Search Directions And Convergence Analysis Of Some Infeasible Path-Following Methods For The Monoton (1996) (17)
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (1992) (17)
Relaxation methods for monotropic programming problems (1986) (17)
Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition (1990) (16)
Relaxation methods for minimum cost network flow problems (1983) (16)
Implementation and Test of Auction Methods for Solving Generalized Network Flow Problems with Separable Convex Cost (2002) (15)
Descent methods for convex essentially smooth minimization (1991) (15)
On the convergence of a matrix splitting algorithm for the symmetric linear complementarity problem (1989) (13)
Enhanced Fritz John Conditions for Convex Programming (2006) (13)
Applications of a Splitting Algorithm to Decomposition in Convex Programming (1988) (10)
The LeChatelier principle: the long and the short of it (2000) (9)
ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems (1997) (9)
A simple complexity proof for a polynomial-time linear programming algorithm (1989) (9)
Convergence and Error Bound for Perturbation of Linear Programs (1999) (8)
RELAXT-III : a new and improved version of the RELAX code (1990) (8)
Error Bounds for Regularized Complementarity Problems (1999) (8)
A simple polynomial-time algorithm for convex quadratic programming (1988) (7)
Relaxation methods for problems with strictly convex costs and linear inequality constraints (1987) (7)
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions (1996) (7)
Successive Projection under a Quasi-Cyclic Order (1990) (7)
ℓ1-Penalized Likelihood Smoothing and Segmentation of Volatility Processes Allowing for Abrupt Changes (2012) (7)
Metric regularity, strong CHIP, and CHIP are distinct properties (2000) (7)
Dual Coordinate Ascent for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach* (1988) (6)
On some interior-point algorithms for nonconvex quadratic optimization (2002) (6)
SIMPLIFIED ANALYSIS OF AN O(nL)-ITERATION INFEASIBLE PREDICTOR-CORRECTOR PATH-FOLLOWING METHOD FOR MONOTONE LINEAR COMPLEMENTARITY PROBLEMS (1995) (6)
Analysis of an Infeasible Interior Path-following Method for Complementarity Problems (1997) (5)
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems (1996) (5)
Translational Cuts for Convex Minimization (1993) (5)
An epsilon-out-of-Kilter Method for Monotropic Programming (2001) (4)
Traffic Equilibrium: Link Flows, Path Flows and Weakly/Strongly Acyclic Solutions (2001) (4)
Block Coordinate Relaxation Methods for (2016) (3)
Partial Affine-Scaling for Linearly Constrained Minimization (1995) (3)
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum (2007) (3)
Further Notes On The Existence Of Search Directions In Interior-Point Methods For The Monotone Semi- (1996) (2)
A path-following algorithm for linear programming using quadratic and logarithmic penalty functions (1993) (2)
Relaxation Method for Linear Programs with Side Constraints (1987) (2)
Linearly constrained convex programming as unconstrained differentiable concave programming (1995) (2)
l1-Penalized Likelihood Smoothing of Volatility Processes allowing for Abrupt Changes (2009) (2)
Book Review: High-order methods for incompressible fluid flow@@@Book Review: Lectures on modern convex optimization: analysis, algorithms and engineering applications (2003) (1)
Relaxation Method for Large Scale Linear Programming Using Decomposition (1991) (1)
An Asynchronous Space Decomposition Method (1998) (1)
Convergence of asynchronous matrix iterations subject to diagonal dominance (1988) (1)
A very simple polynomial-time algorithm for linear programming (1988) (1)
Nearest Q-flat to M Points 1 (1999) (1)
Incrementally Updated Gradient Methods for Constrained and Regularized Optimization (2013) (0)
Polynomial time algorithms for finite horizon, stationary Markov decision processes (1988) (0)
Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation (1989) (0)
Splitting Method for Linear Complementarity Problems (2009) (0)
AN C-RELAXATION METHOD FOR SEPARABLE CONVEX COST NETWORK FLOW PROBLEMS1 (0)
TraÆ Equilibrium : Link Flows , Path Flowsand Weakly / Strongly (2001) (0)
The relaxation method for a special class of linear programming problems (1985) (0)
CLASS OF LINEAR PROGRAMMING PROBLEMS (1985) (0)
Decomposition Algorithm for Convex Differentiable Minimization 1 (0)
Book review (2003) (0)
An Auction Algorithm for the Max-Flow Problem 1 ' 2 (2005) (0)
A comparison between L1 Markov random field-based and wavelet-based estimators (2002) (0)
Revised November 1986 THE RELAX CODES FOR LINEAR MINIMUM COST NETWORK FLOW PROBLEMS by (0)
AN INCREMENTAL GRADIENT METHOD FOR NONSMOOTH OPTIMIZATION (2012) (0)
AN -OUT-OF-KILTER METHODFOR MONOTROPIC PROGRAMMING (2001) (0)

This paper list is powered by the following services:

Other Resources About Paul Tseng

en.wikipedia.org

What Schools Are Affiliated With Paul Tseng?

Paul Tseng is affiliated with the following schools:

Image Attributions

Image Source for Paul Tseng