Paul Tseng

  • University of Washington, Department of Mathematics, Seattle, USA

According to our database1, Paul Tseng authored at least 80 papers between 1986 and 2014.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Incrementally Updated Gradient Methods for Constrained and Regularized Optimization.
J. Optim. Theory Appl., 2014

Hankel Matrix Rank Minimization with Applications to System Identification and Realization.
SIAM J. Matrix Anal. Appl., 2013

Convex Relaxations of the Weighted Maxmin Dispersion Problem.
SIAM J. Optim., 2013

A block coordinate gradient descent method for regularized convex separable optimization and covariance selection.
Math. Program., 2011

A first-order interior-point method for linearly constrained smooth optimization.
Math. Program., 2011

A stackelberg game approach to distributed spectrum management.
Math. Program., 2011

(Robust) Edge-based semidefinite programming relaxation of sensor network localization.
Math. Program., 2011

Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints.
Comput. Optim. Appl., 2011

Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning.
SIAM J. Optim., 2010

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

A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training.
Comput. Optim. Appl., 2010

Splitting Method for Linear Complementarity Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

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

A coordinate gradient descent method for nonsmooth separable minimization.
Math. Program., 2009

Some convex programs without a duality gap.
Math. Program., 2009

Control perspectives on numerical algorithms and matrix problems.
Math. Comput., 2008

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

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints.
SIAM J. Optim., 2007

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

Exact Regularization of Convex Programs.
SIAM J. Optim., 2007

Set Intersection Theorems and Existence of Optimal Solutions.
Math. Program., 2007

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

Enhanced Fritz John Conditions for Convex Programming.
SIAM J. Optim., 2006

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem.
Math. Program., 2005

Analysis of nonsmooth vector-valued functions associated with second-order cones.
Math. Program., 2004

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

Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization.
J. Glob. Optim., 2004

Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation.
SIAM J. Optim., 2003

A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization.
SIAM J. Optim., 2003

Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems.
SIAM J. Optim., 2003

Book review.
Optim. Methods Softw., 2003

Non-Interior continuation methods for solving semidefinite complementarity problems.
Math. Program., 2003

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

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

Smoothing Functions for Second-Order-Cone Complementarity Problems.
SIAM J. Optim., 2002

On some interior-point algorithms for nonconvex quadratic optimization.
Math. Program., 2002

Objective-derivative-free methods for constrained optimization.
Math. Program., 2002

Convergence rate analysis of an asynchronous space decomposition method for convex Minimization.
Math. Comput., 2002

Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search.
Comput. Optim. Appl., 2002

Robust wavelet denoising.
IEEE Trans. Signal Process., 2001

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

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

An ε-relaxation method for separable convex cost generalized network flow problems.
Math. Program., 2000

Co-NP-completeness of some matrix classification problems.
Math. Program., 2000

Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities.
Comput. Optim. Appl., 2000

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

Convergence and Error Bound for Perturbation of Linear Programs.
Comput. Optim. Appl., 1999

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

Merit functions for semi-definite complementarity problems.
Math. Program., 1998

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

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

An ε-Relaxation Method for Separable Convex Cost Network Flow Problems.
SIAM J. Optim., 1997

Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach.
SIAM J. Optim., 1996

A Unified Analysis of Hoffman's Bound via Fenchel Duality.
SIAM J. Optim., 1996

On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions.
J. Algorithms, 1996

A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Partial Affine-Scaling for Linearly Constrained Minimization.
Math. Oper. Res., 1995

On the rate of convergence of a distributed asynchronous routing algorithm.
IEEE Trans. Autom. Control., 1994

Partial Proximal Minimization Algorithms for Convex Pprogramming.
SIAM J. Optim., 1994

Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set.
SIAM J. Optim., 1993

On the convergence of the exponential multiplier method for convex programming.
Math. Program., 1993

Dual coordinate ascent methods for non-strictly convex minimization.
Math. Program., 1993

On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization.
Math. Oper. Res., 1993

Error bounds and convergence analysis of feasible descent methods: a general approach.
Ann. Oper. Res., 1993

On the Convergence of the Products of Firmly Nonexpansive Mappings.
SIAM J. Optim., 1992

Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem.
SIAM J. Optim., 1992

On a global error bound for a class of monotone affine variational inequality problems.
Oper. Res. Lett., 1992

On the convergence of the affine-scaling algorithm.
Math. Program., 1992

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function.
Math. Program., 1992

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm.
SIAM J. Optim., 1991

Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints.
Math. Oper. Res., 1991

Relaxation Method for Large Scale Linear Programming Using Decomposition.
Math. Oper. Res., 1991

Optimal Communication Algorithms for Hypercubes.
J. Parallel Distributed Comput., 1991

Relaxation Methods for Monotropic Programs.
Math. Program., 1990

Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming.
Math. Program., 1990

Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition.
Math. Oper. Res., 1990

Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems.
Oper. Res., 1988

Relaxation methods for problems with strictly convex separable costs and linear constraints.
Math. Program., 1987

Relaxation Methods for Linear Programs.
Math. Oper. Res., 1987

Relaxation methods for monotropic programming problems.
PhD thesis, 1986