default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Tseng
Person information
- affiliation: University of Washington, Department of Mathematics, Seattle, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j78]Paul Tseng, Sangwoon Yun:
Incrementally Updated Gradient Methods for Constrained and Regularized Optimization. J. Optim. Theory Appl. 160(3): 832-853 (2014)- 2013
- [j77]Sheena Haines, Jason L. Loeppky, Paul Tseng, Xianfu Wang:
Convex Relaxations of the Weighted Maxmin Dispersion Problem. SIAM J. Optim. 23(4): 2264-2294 (2013) - [j76]Maryam Fazel, Ting Kei Pong
, Defeng Sun, Paul Tseng:
Hankel Matrix Rank Minimization with Applications to System Identification and Realization. SIAM J. Matrix Anal. Appl. 34(3): 946-977 (2013) - 2011
- [j75]Koichi Nabetani, Paul Tseng, Masao Fukushima:
Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints. Comput. Optim. Appl. 48(3): 423-452 (2011) - [j74]Paul Tseng, Immanuel M. Bomze, Werner Schachinger:
A first-order interior-point method for linearly constrained smooth optimization. Math. Program. 127(2): 399-424 (2011) - [j73]Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang:
A stackelberg game approach to distributed spectrum management. Math. Program. 129(2): 197-224 (2011) - [j72]Sangwoon Yun, Paul Tseng, Kim-Chuan Toh:
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. Math. Program. 129(2): 331-355 (2011) - [j71]Ting Kei Pong, Paul Tseng:
(Robust) Edge-based semidefinite programming relaxation of sensor network localization. Math. Program. 130(2): 321-358 (2011) - 2010
- [j70]Paul Tseng, Sangwoon Yun:
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. 47(2): 179-206 (2010) - [j69]Paul Tseng:
Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125(2): 263-295 (2010) - [j68]Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye:
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning. SIAM J. Optim. 20(6): 3465-3489 (2010)
2000 – 2009
- 2009
- [j67]Paul Tseng:
Some convex programs without a duality gap. Math. Program. 116(1-2): 553-578 (2009) - [j66]Paul Tseng, Sangwoon Yun:
A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1-2): 387-423 (2009) - [j65]Paul Tseng:
Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise. IEEE Trans. Inf. Theory 55(2): 888-899 (2009) - [r1]Paul Tseng:
Splitting Method for Linear Complementarity Problems. Encyclopedia of Optimization 2009: 3659-3662 - 2008
- [j64]Paul Tseng:
Control perspectives on numerical algorithms and matrix problems. Math. Comput. 77(261): 609-610 (2008) - 2007
- [j63]Dimitri P. Bertsekas, Paul Tseng:
Set Intersection Theorems and Existence of Optimal Solutions. Math. Program. 110(2): 287-314 (2007) - [j62]Mihai Anitescu, Paul Tseng, Stephen J. Wright:
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. Math. Program. 110(2): 337-371 (2007) - [j61]Masao Fukushima, Paul Tseng:
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum. SIAM J. Optim. 17(4): 1253-1257 (2007) - [j60]Zhi-Quan Luo, Nicholas D. Sidiropoulos, Paul Tseng, Shuzhong Zhang:
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints. SIAM J. Optim. 18(1): 1-28 (2007) - [j59]Paul Tseng:
Second-Order Cone Programming Relaxation of Sensor Network Localization. SIAM J. Optim. 18(1): 156-185 (2007) - [j58]Michael P. Friedlander, Paul Tseng:
Exact Regularization of Convex Programs. SIAM J. Optim. 18(4): 1326-1350 (2007) - 2006
- [j57]Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng:
Enhanced Fritz John Conditions for Convex Programming. SIAM J. Optim. 16(3): 766-797 (2006) - 2005
- [j56]Jein-Shan Chen, Paul Tseng:
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. Math. Program. 104(2-3): 293-327 (2005) - 2004
- [j55]Paul Tseng:
Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization. J. Glob. Optim. 30(2-3): 285-300 (2004) - [j54]Paul Tseng:
An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods. Math. Oper. Res. 29(1): 27-44 (2004) - [j53]Jein-Shan Chen, Xin Chen, Paul Tseng:
Analysis of nonsmooth vector-valued functions associated with second-order cones. Math. Program. 101(1): 95-117 (2004) - 2003
- [j52]Xin Chen, Paul Tseng:
Non-Interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95(3): 431-474 (2003) - [j51]Paul Tseng:
Book review. Optim. Methods Softw. 18(6): 733 (2003) - [j50]Xin Chen, Houduo Qi, Paul Tseng:
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems. SIAM J. Optim. 13(4): 960-985 (2003) - [j49]Masao Fukushima, Zhi-Quan Luo, Paul Tseng:
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization. SIAM J. Optim. 13(4): 1098-1119 (2003) - [j48]Paul Tseng:
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation. SIAM J. Optim. 14(1): 268-283 (2003) - 2002
- [j47]Larry Nazareth, Paul Tseng:
Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search. Comput. Optim. Appl. 22(1): 133-144 (2002) - [j46]Xue-Cheng Tai, Paul Tseng:
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization. Math. Comput. 71(239): 1105-1135 (2002) - [j45]Stefano Lucidi, Marco Sciandrone, Paul Tseng:
Objective-derivative-free methods for constrained optimization. Math. Program. 92(1): 37-59 (2002) - [j44]Paul Tseng, Yinyu Ye:
On some interior-point algorithms for nonconvex quadratic optimization. Math. Program. 93(2): 217-225 (2002) - [j43]Masao Fukushima, Zhi-Quan Luo, Paul Tseng:
Smoothing Functions for Second-Order-Cone Complementarity Problems. SIAM J. Optim. 12(2): 436-460 (2002) - [j42]Masao Fukushima, Paul Tseng:
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints. SIAM J. Optim. 12(3): 724-739 (2002) - [j41]Paul Tseng:
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization. SIAM J. Optim. 13(2): 432-469 (2002) - 2001
- [j40]Paul Tseng:
An epsilon-out-of-Kilter Method for Monotropic Programming. Math. Oper. Res. 26(2): 221-233 (2001) - [j39]Sylvain Sardy, Paul Tseng, Andrew G. Bruce:
Robust wavelet denoising. IEEE Trans. Signal Process. 49(6): 1146-1152 (2001) - 2000
- [j38]Michael V. Solodov, Paul Tseng:
Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities. Comput. Optim. Appl. 17(2-3): 255-277 (2000) - [j37]Paul Tseng, Dimitri P. Bertsekas:
An ε-relaxation method for separable convex cost generalized network flow problems. Math. Program. 88(1): 85-104 (2000) - [j36]Paul Tseng:
Co-NP-completeness of some matrix classification problems. Math. Program. 88(1): 183-192 (2000) - [j35]Paul Tseng:
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings. SIAM J. Control. Optim. 38(2): 431-446 (2000)
1990 – 1999
- 1999
- [j34]Paul Tseng:
Convergence and Error Bound for Perturbation of Linear Programs. Comput. Optim. Appl. 13(1-3): 221-230 (1999) - [j33]Paul Tseng:
Fortified-Descent Simplicial Search Method: A General Approach. SIAM J. Optim. 10(1): 269-288 (1999) - 1998
- [j32]Paul Tseng:
Merit functions for semi-definite complementarity problems. Math. Program. 83: 159-185 (1998) - [j31]Paul Tseng:
An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule. SIAM J. Optim. 8(2): 506-531 (1998) - 1997
- [j30]Paul Tseng:
An Infeasible Path-Following Method for Monotone Complementarity Problems. SIAM J. Optim. 7(2): 386-402 (1997) - [j29]Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng:
An ε-Relaxation Method for Separable Convex Cost Network Flow Problems. SIAM J. Optim. 7(3): 853-870 (1997) - [j28]Paul Tseng:
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities. SIAM J. Optim. 7(4): 951-965 (1997) - 1996
- [j27]Paul Tseng, Zhi-Quan Luo:
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions. J. Algorithms 21(2): 240-266 (1996) - [j26]James V. Burke, Paul Tseng:
A Unified Analysis of Hoffman's Bound via Fenchel Duality. SIAM J. Optim. 6(2): 265-282 (1996) - [j25]Paul Tseng, Nobuo Yamashita, Masao Fukushima:
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach. SIAM J. Optim. 6(2): 446-460 (1996) - [c1]Paul Tseng, Dimitri P. Bertsekas:
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. IPCO 1996: 85-93 - 1995
- [j24]Paul Tseng:
Partial Affine-Scaling for Linearly Constrained Minimization. Math. Oper. Res. 20(3): 678-694 (1995) - 1994
- [j23]Dimitri P. Bertsekas, Paul Tseng:
Partial Proximal Minimization Algorithms for Convex Pprogramming. SIAM J. Optim. 4(3): 551-572 (1994) - [j22]Zhi-Quan Luo, Paul Tseng:
Perturbation Analysis of a Condition Number for Linear Systems. SIAM J. Matrix Anal. Appl. 15(2): 636-660 (1994) - [j21]Zhi-Quan Luo, Paul Tseng:
On the rate of convergence of a distributed asynchronous routing algorithm. IEEE Trans. Autom. Control. 39(5): 1123-1129 (1994) - 1993
- [j20]Zhi-Quan Luo, Paul Tseng:
Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46-47(1): 157-178 (1993) - [j19]Zhi-Quan Luo, Paul Tseng:
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization. Math. Oper. Res. 18(4): 846-867 (1993) - [j18]Paul Tseng:
Dual coordinate ascent methods for non-strictly convex minimization. Math. Program. 59: 231-247 (1993) - [j17]Paul Tseng, Dimitri P. Bertsekas:
On the convergence of the exponential multiplier method for convex programming. Math. Program. 60: 1-19 (1993) - [j16]Zhi-Quan Luo, Paul Tseng:
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set. SIAM J. Optim. 3(1): 43-59 (1993) - 1992
- [j15]Paul Tseng:
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. Math. Program. 53: 297-306 (1992) - [j14]Paul Tseng, Zhi-Quan Luo:
On the convergence of the affine-scaling algorithm. Math. Program. 56: 301-319 (1992) - [j13]Zhi-Quan Luo, Paul Tseng:
On a global error bound for a class of monotone affine variational inequality problems. Oper. Res. Lett. 11(3): 159-165 (1992) - [j12]Zhi-Quan Luo, Paul Tseng:
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem. SIAM J. Optim. 2(1): 43-54 (1992) - [j11]Paul Tseng:
On the Convergence of the Products of Firmly Nonexpansive Mappings. SIAM J. Optim. 2(3): 425-434 (1992) - 1991
- [j10]Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis:
Optimal Communication Algorithms for Hypercubes. J. Parallel Distributed Comput. 11(4): 263-275 (1991) - [j9]Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. Math. Oper. Res. 16(3): 462-481 (1991) - [j8]Paul Tseng:
Relaxation Method for Large Scale Linear Programming Using Decomposition. Math. Oper. Res. 16(4): 859-880 (1991) - [j7]Paul Tseng:
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm. SIAM J. Optim. 1(4): 603-619 (1991) - 1990
- [j6]Paul Tseng:
Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition. Math. Oper. Res. 15(1): 33-48 (1990) - [j5]Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Monotropic Programs. Math. Program. 46: 127-151 (1990) - [j4]Paul Tseng:
Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming. Math. Program. 48: 249-263 (1990)
1980 – 1989
- 1988
- [j3]Dimitri P. Bertsekas, Paul Tseng:
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. Oper. Res. 36(1): 93-114 (1988) - 1987
- [j2]Paul Tseng, Dimitri P. Bertsekas:
Relaxation Methods for Linear Programs. Math. Oper. Res. 12(4): 569-596 (1987) - [j1]Paul Tseng, Dimitri P. Bertsekas:
Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Program. 38(3): 303-321 (1987) - 1986
- [b1]Paul Tseng:
Relaxation methods for monotropic programming problems. Massachusetts Institute of Technology, Cambridge, MA, USA, 1986
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
