 | 2009 |
|---|
| 22 |       | Paul Tseng:
Splitting Method for Linear Complementarity Problems.
Encyclopedia of Optimization 2009: 3659-3662 |
| 21 | | Paul Tseng:
Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise.
IEEE Transactions on Information Theory 55(2): 888-899 (2009) |
| 20 | | Paul Tseng:
Some convex programs without a duality gap.
Math. Program. 116(1-2): 553-578 (2009) |
| 19 | | Paul Tseng,
Sangwoon Yun:
A coordinate gradient descent method for nonsmooth separable minimization.
Math. Program. 117(1-2): 387-423 (2009) |
| 2007 |
|---|
| 18 | | Dimitri P. Bertsekas,
Paul Tseng:
Set Intersection Theorems and Existence of Optimal Solutions.
Math. Program. 110(2): 287-314 (2007) |
| 17 | | 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): 337-371 (2007) |
| 2005 |
|---|
| 16 | | Jein-Shan Chen,
Paul Tseng:
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem.
Math. Program. 104(2-3): 293-327 (2005) |
| 2004 |
|---|
| 15 | | Paul Tseng:
An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods.
Math. Oper. Res. 29(1): 27-44 (2004) |
| 14 | | Jein-Shan Chen,
Xin Chen,
Paul Tseng:
Analysis of nonsmooth vector-valued functions associated with second-order cones.
Math. Program. 101(1): 95-117 (2004) |
| 2003 |
|---|
| 13 | | Xin Chen,
Paul Tseng:
Non-Interior continuation methods for solving semidefinite complementarity problems.
Math. Program. 95(3): 431-474 (2003) |
| 2002 |
|---|
| 12 |  | Xue-Cheng Tai,
Paul Tseng:
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization.
Math. Comput. 71(239): 1105-1135 (2002) |
| 2001 |
|---|
| 11 | | Paul Tseng:
An epsilon-out-of-Kilter Method for Monotropic Programming.
Math. Oper. Res. 26(2): 221-233 (2001) |
| 1998 |
|---|
| 10 | | Paul Tseng:
Merit functions for semi-definite complementarity problems.
Math. Program. 83: 159-185 (1998) |
| 1996 |
|---|
| 9 | | Paul Tseng,
Dimitri P. Bertsekas:
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems.
IPCO 1996: 85-93 |
| 8 | | Paul Tseng,
Zhi-Quan Luo:
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions.
J. Algorithms 21(2): 240-266 (1996) |
| 1993 |
|---|
| 7 | | Paul Tseng:
Dual coordinate ascent methods for non-strictly convex minimization.
Math. Program. 59: 231-247 (1993) |
| 6 | | Paul Tseng,
Dimitri P. Bertsekas:
On the convergence of the exponential multiplier method for convex programming.
Math. Program. 60: 1-19 (1993) |
| 1992 |
|---|
| 5 | | Paul Tseng:
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function.
Math. Program. 53: 297-306 (1992) |
| 4 | | Paul Tseng,
Zhi-Quan Luo:
On the convergence of the affine-scaling algorithm.
Math. Program. 56: 301-319 (1992) |
| 1991 |
|---|
| 3 | | Dimitri P. Bertsekas,
C. Özveren,
George D. Stamoulis,
Paul Tseng,
John N. Tsitsiklis:
Optimal Communication Algorithms for Hypercubes.
J. Parallel Distrib. Comput. 11(4): 263-275 (1991) |
| 1990 |
|---|
| 2 | | Paul Tseng,
Dimitri P. Bertsekas:
Relaxation Methods for Monotropic Programs.
Math. Program. 46: 127-151 (1990) |
| 1 | | Paul Tseng:
Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming.
Math. Program. 48: 249-263 (1990) |
