Paul Tseng

According to our database, Paul Tseng authored at least 81 papers between 1986 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2014

Incrementally Updated Gradient Methods for Constrained and Regularized Optimization.

Paul Tseng, Sangwoon Yun

J. Optim. Theory Appl., 2014

2013

Hankel Matrix Rank Minimization with Applications to System Identification and Realization.

Maryam Fazel, Ting Kei Pong, Defeng Sun, Paul Tseng

SIAM J. Matrix Anal. Appl., 2013

Convex Relaxations of the Weighted Maxmin Dispersion Problem.

Sheena Haines, Jason L. Loeppky, Paul Tseng, Xianfu Wang

SIAM J. Optim., 2013

2011

A block coordinate gradient descent method for regularized convex separable optimization and covariance selection.

Sangwoon Yun, Paul Tseng, Kim-Chuan Toh

Math. Program., 2011

A first-order interior-point method for linearly constrained smooth optimization.

Paul Tseng, Immanuel M. Bomze, Werner Schachinger

Math. Program., 2011

A stackelberg game approach to distributed spectrum management.

Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang

Math. Program., 2011

(Robust) Edge-based semidefinite programming relaxation of sensor network localization.

Ting Kei Pong, Paul Tseng

Math. Program., 2011

Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints.

Koichi Nabetani, Paul Tseng, Masao Fukushima

Comput. Optim. Appl., 2011

2010

Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning.

Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye

SIAM J. Optim., 2010

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

Paul Tseng

Math. Program., 2010

A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training.

Paul Tseng, Sangwoon Yun

Comput. Optim. Appl., 2010

2009

Splitting Method for Linear Complementarity Problems.

Paul Tseng

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise.

Paul Tseng

IEEE Trans. Inf. Theory, 2009

A coordinate gradient descent method for nonsmooth separable minimization.

Paul Tseng, Sangwoon Yun

Math. Program., 2009

Some convex programs without a duality gap.

Paul Tseng

Math. Program., 2009

2008

Control perspectives on numerical algorithms and matrix problems.

Paul Tseng

Math. Comput., 2008

2007

Second-Order Cone Programming Relaxation of Sensor Network Localization.

Paul Tseng

SIAM J. Optim., 2007

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints.

Zhi-Quan Luo, Nicholas D. Sidiropoulos, Paul Tseng, Shuzhong Zhang

SIAM J. Optim., 2007

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum.

Masao Fukushima, Paul Tseng

SIAM J. Optim., 2007

Exact Regularization of Convex Programs.

Michael P. Friedlander, Paul Tseng

SIAM J. Optim., 2007

Set Intersection Theorems and Existence of Optimal Solutions.

Dimitri P. Bertsekas, Paul Tseng

Math. Program., 2007

Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties.

Mihai Anitescu, Paul Tseng, Stephen J. Wright

Math. Program., 2007

2006

Enhanced Fritz John Conditions for Convex Programming.

Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng

SIAM J. Optim., 2006

2005

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem.

Jein-Shan Chen, Paul Tseng

Math. Program., 2005

2004

Analysis of nonsmooth vector-valued functions associated with second-order cones.

Jein-Shan Chen, Xin Chen, Paul Tseng

Math. Program., 2004

An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods.

Paul Tseng

Math. Oper. Res., 2004

Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization.

Paul Tseng

J. Glob. Optim., 2004

2003

Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation.

Paul Tseng

SIAM J. Optim., 2003

A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization.

Masao Fukushima, Zhi-Quan Luo, Paul Tseng

SIAM J. Optim., 2003

Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems.

Xin Chen, Houduo Qi, Paul Tseng

SIAM J. Optim., 2003

Book review.

Paul Tseng

Optim. Methods Softw., 2003

Non-Interior continuation methods for solving semidefinite complementarity problems.

Xin Chen, Paul Tseng

Math. Program., 2003

2002

Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization.

Paul Tseng

SIAM J. Optim., 2002

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints.

Masao Fukushima, Paul Tseng

SIAM J. Optim., 2002

Smoothing Functions for Second-Order-Cone Complementarity Problems.

Masao Fukushima, Zhi-Quan Luo, Paul Tseng

SIAM J. Optim., 2002

On some interior-point algorithms for nonconvex quadratic optimization.

Paul Tseng, Yinyu Ye

Math. Program., 2002

Objective-derivative-free methods for constrained optimization.

Stefano Lucidi, Marco Sciandrone, Paul Tseng

Math. Program., 2002

Convergence rate analysis of an asynchronous space decomposition method for convex Minimization.

Xue-Cheng Tai, Paul Tseng

Math. Comput., 2002

Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search.

Larry Nazareth, Paul Tseng

Comput. Optim. Appl., 2002

2001

Robust wavelet denoising.

Sylvain Sardy, Paul Tseng, Andrew G. Bruce

IEEE Trans. Signal Process., 2001

An epsilon-out-of-Kilter Method for Monotropic Programming.

Paul Tseng

Math. Oper. Res., 2001

2000

A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings.

Paul Tseng

SIAM J. Control. Optim., 2000

An ε-relaxation method for separable convex cost generalized network flow problems.

Paul Tseng, Dimitri P. Bertsekas

Math. Program., 2000

Co-NP-completeness of some matrix classification problems.

Paul Tseng

Math. Program., 2000

Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities.

Michael V. Solodov, Paul Tseng

Comput. Optim. Appl., 2000

1999

Fortified-Descent Simplicial Search Method: A General Approach.

Paul Tseng

SIAM J. Optim., 1999

Convergence and Error Bound for Perturbation of Linear Programs.

Paul Tseng

Comput. Optim. Appl., 1999

1998

An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule.

Paul Tseng

SIAM J. Optim., 1998

Merit functions for semi-definite complementarity problems.

Paul Tseng

Math. Program., 1998

1997

Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities.

Paul Tseng

SIAM J. Optim., 1997

An Infeasible Path-Following Method for Monotone Complementarity Problems.

Paul Tseng

SIAM J. Optim., 1997

An ε-Relaxation Method for Separable Convex Cost Network Flow Problems.

Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng

SIAM J. Optim., 1997

1996

Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach.

Paul Tseng, Nobuo Yamashita, Masao Fukushima

SIAM J. Optim., 1996

A Unified Analysis of Hoffman's Bound via Fenchel Duality.

James V. Burke, Paul Tseng

SIAM J. Optim., 1996

On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions.

Paul Tseng, Zhi-Quan Luo

J. Algorithms, 1996

A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems.

Paul Tseng, Dimitri P. Bertsekas

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Partial Affine-Scaling for Linearly Constrained Minimization.

Paul Tseng

Math. Oper. Res., 1995

1994

Perturbation Analysis of a Condition Number for Linear Systems.

Zhi-Quan Luo, Paul Tseng

SIAM J. Matrix Anal. Appl., April, 1994

On the rate of convergence of a distributed asynchronous routing algorithm.

Zhi-Quan Luo, Paul Tseng

IEEE Trans. Autom. Control., 1994

Partial Proximal Minimization Algorithms for Convex Pprogramming.

Dimitri P. Bertsekas, Paul Tseng

SIAM J. Optim., 1994

1993

Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set.

Zhi-Quan Luo, Paul Tseng

SIAM J. Optim., 1993

On the convergence of the exponential multiplier method for convex programming.

Paul Tseng, Dimitri P. Bertsekas

Math. Program., 1993

Dual coordinate ascent methods for non-strictly convex minimization.

Paul Tseng

Math. Program., 1993

On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization.

Zhi-Quan Luo, Paul Tseng

Math. Oper. Res., 1993

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

Zhi-Quan Luo, Paul Tseng

Ann. Oper. Res., 1993

1992

On the Convergence of the Products of Firmly Nonexpansive Mappings.

Paul Tseng

SIAM J. Optim., 1992

Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem.

Zhi-Quan Luo, Paul Tseng

SIAM J. Optim., 1992

On a global error bound for a class of monotone affine variational inequality problems.

Zhi-Quan Luo, Paul Tseng

Oper. Res. Lett., 1992

On the convergence of the affine-scaling algorithm.

Paul Tseng, Zhi-Quan Luo

Math. Program., 1992

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function.

Paul Tseng

Math. Program., 1992

1991

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm.

Paul Tseng

SIAM J. Optim., 1991

Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints.

Paul Tseng, Dimitri P. Bertsekas

Math. Oper. Res., 1991

Relaxation Method for Large Scale Linear Programming Using Decomposition.

Paul Tseng

Math. Oper. Res., 1991

Optimal Communication Algorithms for Hypercubes.

Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis

J. Parallel Distributed Comput., 1991

1990

Relaxation Methods for Monotropic Programs.

Paul Tseng, Dimitri P. Bertsekas

Math. Program., 1990

Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming.

Paul Tseng

Math. Program., 1990

Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition.

Paul Tseng

Math. Oper. Res., 1990

1988

Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems.

Dimitri P. Bertsekas, Paul Tseng

Oper. Res., 1988

1987

Relaxation methods for problems with strictly convex separable costs and linear constraints.

Paul Tseng, Dimitri P. Bertsekas

Math. Program., 1987

Relaxation Methods for Linear Programs.

Paul Tseng, Dimitri P. Bertsekas

Math. Oper. Res., 1987

1986

Relaxation methods for monotropic programming problems.

Paul Tseng

PhD thesis, 1986