Incrementally Updated Gradient Methods for Constrained and Regularized Optimization. - Tseng, Paul; Yun, Sangwoon (J. Optim. Theory Appl., 2014)

Convex Relaxations of the Weighted Maxmin Dispersion Problem. - Haines, Sheena; Loeppky, Jason L.; Tseng, Paul; Wang, Xianfu (SIAM J. Optim., 2013)

Hankel Matrix Rank Minimization with Applications to System Identification and Realization. - Fazel, Maryam; Pong, Ting Kei; Sun, Defeng; Tseng, Paul (SIAM J. Matrix Anal. Appl., 2013)

Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints. - Nabetani, Koichi; Tseng, Paul; Fukushima, Masao (Comput. Optim. Appl., 2011)

A first-order interior-point method for linearly constrained smooth optimization. - Tseng, Paul; Bomze, Immanuel M.; Schachinger, Werner (Math. Program., 2011)

A stackelberg game approach to distributed spectrum management. - Razaviyayn, Meisam; Luo, Zhi-Quan; Tseng, Paul; Pang, Jong-Shi (Math. Program., 2011)

A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. - Yun, Sangwoon; Tseng, Paul; Toh, Kim-Chuan (Math. Program., 2011)

(Robust) Edge-based semidefinite programming relaxation of sensor network localization. - Pong, Ting Kei; Tseng, Paul (Math. Program., 2011)

A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. - Tseng, Paul; Yun, Sangwoon (Comput. Optim. Appl., 2010)

Approximation accuracy, gradient methods, and error bound for structured convex optimization. - Tseng, Paul (Math. Program., 2010)

Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning. - Pong, Ting Kei; Tseng, Paul; Ji, Shuiwang; Ye, Jieping (SIAM J. Optim., 2010)

Some convex programs without a duality gap. - Tseng, Paul (Math. Program., 2009)

A coordinate gradient descent method for nonsmooth separable minimization. - Tseng, Paul; Yun, Sangwoon (Math. Program., 2009)

Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise. - Tseng, Paul (IEEE Trans. Inf. Theory, 2009)

Splitting Method for Linear Complementarity Problems. - Tseng, Paul (2009)

Control perspectives on numerical algorithms and matrix problems. - Tseng, Paul (Math. Comput., 2008)

Set Intersection Theorems and Existence of Optimal Solutions. - Bertsekas, Dimitri P.; Tseng, Paul (Math. Program., 2007)

Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. - Anitescu, Mihai; Tseng, Paul; Wright, Stephen J. (Math. Program., 2007)

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum. - Fukushima, Masao; Tseng, Paul (SIAM J. Optim., 2007)

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints. - Luo, Zhi-Quan; Sidiropoulos, Nicholas D.; Tseng, Paul; Zhang, Shuzhong (SIAM J. Optim., 2007)

Second-Order Cone Programming Relaxation of Sensor Network Localization. - Tseng, Paul (SIAM J. Optim., 2007)

Exact Regularization of Convex Programs. - Friedlander, Michael P.; Tseng, Paul (SIAM J. Optim., 2007)

Enhanced Fritz John Conditions for Convex Programming. - Bertsekas, Dimitri P.; Ozdaglar, Asuman E.; Tseng, Paul (SIAM J. Optim., 2006)

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. - Chen, Jein-Shan; Tseng, Paul (Math. Program., 2005)

Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization. - Tseng, Paul (J. Glob. Optim., 2004)

An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods. - Tseng, Paul (Math. Oper. Res., 2004)

Analysis of nonsmooth vector-valued functions associated with second-order cones. - Chen, Jein-Shan; Chen, Xin; Tseng, Paul (Math. Program., 2004)

Non-Interior continuation methods for solving semidefinite complementarity problems. - Chen, Xin; Tseng, Paul (Math. Program., 2003)

Book review. - Tseng, Paul (Optim. Methods Softw., 2003)

Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems. - Chen, Xin; Qi, Houduo; Tseng, Paul (SIAM J. Optim., 2003)

A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization. - Fukushima, Masao; Luo, Zhi-Quan; Tseng, Paul (SIAM J. Optim., 2003)

Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation. - Tseng, Paul (SIAM J. Optim., 2003)

Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search. - Nazareth, Larry; Tseng, Paul (Comput. Optim. Appl., 2002)

Convergence rate analysis of an asynchronous space decomposition method for convex Minimization. - Tai, Xue-Cheng; Tseng, Paul (Math. Comput., 2002)

Objective-derivative-free methods for constrained optimization. - Lucidi, Stefano; Sciandrone, Marco; Tseng, Paul (Math. Program., 2002)

On some interior-point algorithms for nonconvex quadratic optimization. - Tseng, Paul; Ye, Yinyu (Math. Program., 2002)

Smoothing Functions for Second-Order-Cone Complementarity Problems. - Fukushima, Masao; Luo, Zhi-Quan; Tseng, Paul (SIAM J. Optim., 2002)

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints. - Fukushima, Masao; Tseng, Paul (SIAM J. Optim., 2002)

Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization. - Tseng, Paul (SIAM J. Optim., 2002)

An epsilon-out-of-Kilter Method for Monotropic Programming. - Tseng, Paul (Math. Oper. Res., 2001)

Robust wavelet denoising. - Sardy, Sylvain; Tseng, Paul; Bruce, Andrew G. (IEEE Trans. Signal Process., 2001)

Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities. - Solodov, Michael V.; Tseng, Paul (Comput. Optim. Appl., 2000)

An ε-relaxation method for separable convex cost generalized network flow problems. - Tseng, Paul; Bertsekas, Dimitri P. (Math. Program., 2000)

Co-NP-completeness of some matrix classification problems. - Tseng, Paul (Math. Program., 2000)

A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings. - Tseng, Paul (SIAM J. Control. Optim., 2000)

Convergence and Error Bound for Perturbation of Linear Programs. - Tseng, Paul (Comput. Optim. Appl., 1999)

Fortified-Descent Simplicial Search Method: A General Approach. - Tseng, Paul (SIAM J. Optim., 1999)

Merit functions for semi-definite complementarity problems. - Tseng, Paul (Math. Program., 1998)

An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule. - Tseng, Paul (SIAM J. Optim., 1998)

An Infeasible Path-Following Method for Monotone Complementarity Problems. - Tseng, Paul (SIAM J. Optim., 1997)

An ε-Relaxation Method for Separable Convex Cost Network Flow Problems. - Bertsekas, Dimitri P.; Polymenakos, Lazaros C.; Tseng, Paul (SIAM J. Optim., 1997)

Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities. - Tseng, Paul (SIAM J. Optim., 1997)

On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions. - Tseng, Paul; Luo, Zhi-Quan (J. Algorithms, 1996)

A Unified Analysis of Hoffman's Bound via Fenchel Duality. - Burke, James V.; Tseng, Paul (SIAM J. Optim., 1996)

Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach. - Tseng, Paul; Yamashita, Nobuo; Fukushima, Masao (SIAM J. Optim., 1996)

A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. - Tseng, Paul; Bertsekas, Dimitri P. (1996)

Partial Affine-Scaling for Linearly Constrained Minimization. - Tseng, Paul (Math. Oper. Res., 1995)

Partial Proximal Minimization Algorithms for Convex Pprogramming. - Bertsekas, Dimitri P.; Tseng, Paul (SIAM J. Optim., 1994)

Perturbation Analysis of a Condition Number for Linear Systems. - Luo, Zhi-Quan; Tseng, Paul (SIAM J. Matrix Anal. Appl., 1994)

On the rate of convergence of a distributed asynchronous routing algorithm. - Luo, Zhi-Quan; Tseng, Paul (IEEE Trans. Autom. Control., 1994)

Error bounds and convergence analysis of feasible descent methods: a general approach. - Luo, Zhi-Quan; Tseng, Paul (Ann. Oper. Res., 1993)

On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization. - Luo, Zhi-Quan; Tseng, Paul (Math. Oper. Res., 1993)

Dual coordinate ascent methods for non-strictly convex minimization. - Tseng, Paul (Math. Program., 1993)

On the convergence of the exponential multiplier method for convex programming. - Tseng, Paul; Bertsekas, Dimitri P. (Math. Program., 1993)

Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set. - Luo, Zhi-Quan; Tseng, Paul (SIAM J. Optim., 1993)

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. - Tseng, Paul (Math. Program., 1992)

On the convergence of the affine-scaling algorithm. - Tseng, Paul; Luo, Zhi-Quan (Math. Program., 1992)

On a global error bound for a class of monotone affine variational inequality problems. - Luo, Zhi-Quan; Tseng, Paul (Oper. Res. Lett., 1992)

Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem. - Luo, Zhi-Quan; Tseng, Paul (SIAM J. Optim., 1992)

On the Convergence of the Products of Firmly Nonexpansive Mappings. - Tseng, Paul (SIAM J. Optim., 1992)

Optimal Communication Algorithms for Hypercubes. - Bertsekas, Dimitri P.; Özveren, C.; Stamoulis, George D.; Tseng, Paul; Tsitsiklis, John N. (J. Parallel Distributed Comput., 1991)

Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. - Tseng, Paul; Bertsekas, Dimitri P. (Math. Oper. Res., 1991)

Relaxation Method for Large Scale Linear Programming Using Decomposition. - Tseng, Paul (Math. Oper. Res., 1991)

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm. - Tseng, Paul (SIAM J. Optim., 1991)

Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition. - Tseng, Paul (Math. Oper. Res., 1990)

Relaxation Methods for Monotropic Programs. - Tseng, Paul; Bertsekas, Dimitri P. (Math. Program., 1990)

Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming. - Tseng, Paul (Math. Program., 1990)

Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. - Bertsekas, Dimitri P.; Tseng, Paul (Oper. Res., 1988)

Relaxation Methods for Linear Programs. - Tseng, Paul; Bertsekas, Dimitri P. (Math. Oper. Res., 1987)

Relaxation methods for problems with strictly convex separable costs and linear constraints. - Tseng, Paul; Bertsekas, Dimitri P. (Math. Program., 1987)

Relaxation methods for monotropic programming problems. - Tseng, Paul (1986)