Paul Tseng

Publication Activity (10 Years)

Years Active: 1987-2014
Publications (10 Years): 0

Top Venues

SIAM J. Optim.

J. Optim. Theory Appl.

SIAM J. Matrix Anal. Appl.

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Paul Tseng, Sangwoon Yun
Incrementally Updated Gradient Methods for Constrained and Regularized Optimization. J. Optim. Theory Appl. 160 (3) (2014)
Sheena Haines, Jason L. Loeppky, Paul Tseng, Xianfu Wang
Convex Relaxations of the Weighted Maxmin Dispersion Problem. SIAM J. Optim. 23 (4) (2013)
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) (2013)
Paul Tseng, Immanuel M. Bomze, Werner Schachinger
A first-order interior-point method for linearly constrained smooth optimization. Math. Program. 127 (2) (2011)
Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang
A stackelberg game approach to distributed spectrum management. Math. Program. 129 (2) (2011)
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) (2011)
Ting Kei Pong, Paul Tseng
(Robust) Edge-based semidefinite programming relaxation of sensor network localization. Math. Program. 130 (2) (2011)
Koichi Nabetani, Paul Tseng, Masao Fukushima
Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints. Comput. Optim. Appl. 48 (3) (2011)
Paul Tseng
Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125 (2) (2010)
Paul Tseng, Sangwoon Yun
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. 47 (2) (2010)
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning. SIAM J. Optim. 20 (6) (2010)
Paul Tseng
Some convex programs without a duality gap. Math. Program. 116 (1-2) (2009)
Paul Tseng
Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise. IEEE Trans. Inf. Theory 55 (2) (2009)
Paul Tseng, Sangwoon Yun
A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117 (1-2) (2009)
Paul Tseng
Control perspectives on numerical algorithms and matrix problems. Math. Comput. 77 (261) (2008)
Michael P. Friedlander, Paul Tseng
Exact Regularization of Convex Programs. SIAM J. Optim. 18 (4) (2007)
Paul Tseng
Second-Order Cone Programming Relaxation of Sensor Network Localization. SIAM J. Optim. 18 (1) (2007)
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) (2007)
Zhi-Quan Luo, Nicholas D. Sidiropoulos, Paul Tseng, Shuzhong Zhang
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints. SIAM J. Optim. 18 (1) (2007)
Dimitri P. Bertsekas, Paul Tseng
Set Intersection Theorems and Existence of Optimal Solutions. Math. Program. 110 (2) (2007)
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) (2007)
Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng
Enhanced Fritz John Conditions for Convex Programming. SIAM J. Optim. 16 (3) (2006)
Jein-Shan Chen, Paul Tseng
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. Math. Program. 104 (2-3) (2005)
Jein-Shan Chen, Xin Chen, Paul Tseng
Analysis of nonsmooth vector-valued functions associated with second-order cones. Math. Program. 101 (1) (2004)
Paul Tseng
An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods. Math. Oper. Res. 29 (1) (2004)
Paul Tseng
Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization. J. Glob. Optim. 30 (2-3) (2004)
Xin Chen, Paul Tseng
Non-Interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95 (3) (2003)
Masao Fukushima, Zhi-Quan Luo, Paul Tseng
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization. SIAM J. Optim. 13 (4) (2003)
Xin Chen, Houduo Qi, Paul Tseng
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems. SIAM J. Optim. 13 (4) (2003)
Paul Tseng
Book review. Optim. Methods Softw. 18 (6) (2003)
Paul Tseng
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation. SIAM J. Optim. 14 (1) (2003)
Paul Tseng
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization. SIAM J. Optim. 13 (2) (2002)
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) (2002)
Stefano Lucidi, Marco Sciandrone, Paul Tseng
Objective-derivative-free methods for constrained optimization. Math. Program. 92 (1) (2002)
Paul Tseng, Yinyu Ye
On some interior-point algorithms for nonconvex quadratic optimization. Math. Program. 93 (2) (2002)
Xue-Cheng Tai, Paul Tseng
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization. Math. Comput. 71 (239) (2002)
Masao Fukushima, Zhi-Quan Luo, Paul Tseng
Smoothing Functions for Second-Order-Cone Complementarity Problems. SIAM J. Optim. 12 (2) (2002)
Larry Nazareth, Paul Tseng
Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search. Comput. Optim. Appl. 22 (1) (2002)
Paul Tseng
An epsilon-out-of-Kilter Method for Monotropic Programming. Math. Oper. Res. 26 (2) (2001)
Sylvain Sardy, Paul Tseng, Andrew G. Bruce
Robust wavelet denoising. IEEE Trans. Signal Process. 49 (6) (2001)
Michael V. Solodov, Paul Tseng
Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities. Comput. Optim. Appl. 17 (2-3) (2000)
Paul Tseng, Dimitri P. Bertsekas
An ε-relaxation method for separable convex cost generalized network flow problems. Math. Program. 88 (1) (2000)
Paul Tseng
Co-NP-completeness of some matrix classification problems. Math. Program. 88 (1) (2000)
Paul Tseng
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings. SIAM J. Control. Optim. 38 (2) (2000)
Paul Tseng
Convergence and Error Bound for Perturbation of Linear Programs. Comput. Optim. Appl. 13 (1-3) (1999)
Paul Tseng
Fortified-Descent Simplicial Search Method: A General Approach. SIAM J. Optim. 10 (1) (1999)
Paul Tseng
Merit functions for semi-definite complementarity problems. Math. Program. 83 (1998)
Paul Tseng
An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule. SIAM J. Optim. 8 (2) (1998)
Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng
An ε-Relaxation Method for Separable Convex Cost Network Flow Problems. SIAM J. Optim. 7 (3) (1997)
Paul Tseng
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities. SIAM J. Optim. 7 (4) (1997)
Paul Tseng
An Infeasible Path-Following Method for Monotone Complementarity Problems. SIAM J. Optim. 7 (2) (1997)
James V. Burke, Paul Tseng
A Unified Analysis of Hoffman's Bound via Fenchel Duality. SIAM J. Optim. 6 (2) (1996)
Paul Tseng, Dimitri P. Bertsekas
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. IPCO (1996)
Paul Tseng, Zhi-Quan Luo
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions. J. Algorithms 21 (2) (1996)
Paul Tseng, Nobuo Yamashita, Masao Fukushima
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach. SIAM J. Optim. 6 (2) (1996)
Paul Tseng
Partial Affine-Scaling for Linearly Constrained Minimization. Math. Oper. Res. 20 (3) (1995)
Zhi-Quan Luo, Paul Tseng
On the rate of convergence of a distributed asynchronous routing algorithm. IEEE Trans. Autom. Control. 39 (5) (1994)
Zhi-Quan Luo, Paul Tseng
Perturbation Analysis of a Condition Number for Linear Systems. SIAM J. Matrix Anal. Appl. 15 (2) (1994)
Dimitri P. Bertsekas, Paul Tseng
Partial Proximal Minimization Algorithms for Convex Pprogramming. SIAM J. Optim. 4 (3) (1994)
Paul Tseng
Dual coordinate ascent methods for non-strictly convex minimization. Math. Program. 59 (1993)
Paul Tseng, Dimitri P. Bertsekas
On the convergence of the exponential multiplier method for convex programming. Math. Program. 60 (1993)
Zhi-Quan Luo, Paul Tseng
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization. Math. Oper. Res. 18 (4) (1993)
Zhi-Quan Luo, Paul Tseng
Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. (1) (1993)
Zhi-Quan Luo, Paul Tseng
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set. SIAM J. Optim. 3 (1) (1993)
Paul Tseng, Zhi-Quan Luo
On the convergence of the affine-scaling algorithm. Math. Program. 56 (1992)
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) (1992)
Zhi-Quan Luo, Paul Tseng
On a global error bound for a class of monotone affine variational inequality problems. Oper. Res. Lett. 11 (3) (1992)
Paul Tseng
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. Math. Program. 53 (1992)
Paul Tseng
On the Convergence of the Products of Firmly Nonexpansive Mappings. SIAM J. Optim. 2 (3) (1992)
Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis
Optimal Communication Algorithms for Hypercubes. J. Parallel Distributed Comput. 11 (4) (1991)
Paul Tseng, Dimitri P. Bertsekas
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. Math. Oper. Res. 16 (3) (1991)
Paul Tseng
Relaxation Method for Large Scale Linear Programming Using Decomposition. Math. Oper. Res. 16 (4) (1991)
Paul Tseng
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm. SIAM J. Optim. 1 (4) (1991)
Paul Tseng, Dimitri P. Bertsekas
Relaxation Methods for Monotropic Programs. Math. Program. 46 (1990)
Paul Tseng
Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition. Math. Oper. Res. 15 (1) (1990)
Paul Tseng
Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming. Math. Program. 48 (1990)
Dimitri P. Bertsekas, Paul Tseng
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. Oper. Res. 36 (1) (1988)
Paul Tseng, Dimitri P. Bertsekas
Relaxation Methods for Linear Programs. Math. Oper. Res. 12 (4) (1987)
Paul Tseng, Dimitri P. Bertsekas
Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Program. 38 (3) (1987)

Paul Tseng.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paul Tseng