Paul Tseng
Affiliations: University of Washington, Department of Mathematics, Seattle, USA
According to our database^{1},
Paul Tseng
authored at least 80 papers
between 1986 and 2014.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on id.loc.gov

on dnb.info
On csauthors.net:
Bibliography
2014
Incrementally Updated Gradient Methods for Constrained and Regularized Optimization.
J. Optim. Theory Appl., 2014
2013
Hankel Matrix Rank Minimization with Applications to System Identification and Realization.
SIAM J. Matrix Anal. Appl., 2013
SIAM J. Optim., 2013
2011
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection.
Math. Program., 2011
Math. Program., 2011
Math. Program., 2011
(Robust) Edgebased 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
2010
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
2009
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
Math. Program., 2009
Math. Program., 2009
2008
Math. Comput., 2008
2007
SIAM J. Optim., 2007
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints.
SIAM J. Optim., 2007
An Implementable ActiveSet Algorithm for Computing a BStationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum.
SIAM J. Optim., 2007
SIAM J. Optim., 2007
Math. Program., 2007
Elasticmode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties.
Math. Program., 2007
2006
SIAM J. Optim., 2006
2005
An unconstrained smooth minimization reformulation of the secondorder cone complementarity problem.
Math. Program., 2005
2004
Math. Program., 2004
Math. Oper. Res., 2004
Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization.
J. Glob. Optim., 2004
2003
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 SymmetricMatrixValued Functions with Applications to Semidefinite Complementarity Problems.
SIAM J. Optim., 2003
Optim. Methods Softw., 2003
NonInterior continuation methods for solving semidefinite complementarity problems.
Math. Program., 2003
2002
Convergent Infeasible InteriorPoint TrustRegion Methods for Constrained Minimization.
SIAM J. Optim., 2002
An Implementable ActiveSet Algorithm for Computing a BStationary Point of a Mathematical Program with Linear Complementarity Constraints.
SIAM J. Optim., 2002
SIAM J. Optim., 2002
Math. Program., 2002
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 NelderMead Algorithm Based on GoldenSection Search.
Comput. Optim. Appl., 2002
2001
IEEE Trans. Signal Process., 2001
Math. Oper. Res., 2001
2000
SIAM J. Control. Optim., 2000
An εrelaxation method for separable convex cost generalized network flow problems.
Math. Program., 2000
Math. Program., 2000
Some Methods Based on the DGap Function for Solving Monotone Variational Inequalities.
Comput. Optim. Appl., 2000
1999
SIAM J. Optim., 1999
Comput. Optim. Appl., 1999
1998
An Incremental Gradient(Projection) Method with Momentum Term and Adaptive Stepsize Rule.
SIAM J. Optim., 1998
Math. Program., 1998
1997
Alternating ProjectionProximal Methods for Convex Programming and Variational Inequalities.
SIAM J. Optim., 1997
SIAM J. Optim., 1997
SIAM J. Optim., 1997
1996
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach.
SIAM J. Optim., 1996
SIAM J. Optim., 1996
On Computing the Nested Sums and Infimal Convolutions of Convex PiecewiseLinear Functions.
J. Algorithms, 1996
A epsilonRelaxation Method for Generalized Separable Convex Cost Network Flow Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Math. Oper. Res., 1995
1994
IEEE Trans. Autom. Control., 1994
SIAM J. Optim., 1994
1993
Error Bound and ReducedGradient Projection Algorithms for Convex Minimization over a Polyhedral Set.
SIAM J. Optim., 1993
Math. Program., 1993
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
1992
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
Math. Program., 1992
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function.
Math. Program., 1992
1991
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
Math. Oper. Res., 1991
J. Parallel Distributed Comput., 1991
1990
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
1988
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems.
Oper. Res., 1988
1987
Relaxation methods for problems with strictly convex separable costs and linear constraints.
Math. Program., 1987
Math. Oper. Res., 1987
1986
PhD thesis, 1986