Search the dblp DataBase

Publications of Author

1. Paul Tseng, Dimitri P. Bertsekas
   A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. [Citation Graph (0, 0)][DBLP]
   IPCO, 1996, pp:85-93 [Conf]
   
2. Paul Tseng, Zhi-Quan Luo
   On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:2, pp:240-266 [Journal]
   
3. Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis
   Optimal Communication Algorithms for Hypercubes. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1991, v:11, n:4, pp:263-275 [Journal]
   
4. Xue-Cheng Tai, Paul Tseng
   Convergence rate analysis of an asynchronous space decomposition method for convex Minimization. [Citation Graph (0, 0)][DBLP]
   Math. Comput., 2002, v:71, n:239, pp:1105-1135 [Journal]
   
5. Paul Tseng
   An epsilon-out-of-Kilter Method for Monotropic Programming. [Citation Graph (0, 0)][DBLP]
   Math. Oper. Res., 2001, v:26, n:2, pp:221-233 [Journal]
   
6. Paul Tseng
   An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods. [Citation Graph (0, 0)][DBLP]
   Math. Oper. Res., 2004, v:29, n:1, pp:27-44 [Journal]
   
7. Jein-Shan Chen, Xin Chen, Paul Tseng
   Analysis of nonsmooth vector-valued functions associated with second-order cones. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2004, v:101, n:1, pp:95-117 [Journal]
   
8. Xin Chen, Paul Tseng
   Non-Interior continuation methods for solving semidefinite complementarity problems. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:431-474 [Journal]
   
9. Jein-Shan Chen, Paul Tseng
   An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2005, v:104, n:2-3, pp:293-327 [Journal]
   
10. Paul Tseng
    Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:48, n:, pp:249-263 [Journal]
    
11. Paul Tseng
    Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:297-306 [Journal]
    
12. Paul Tseng
    Dual coordinate ascent methods for non-strictly convex minimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:59, n:, pp:231-247 [Journal]
    
13. Paul Tseng
    Merit functions for semi-definite complementarity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:83, n:, pp:159-185 [Journal]
    
14. Paul Tseng, Dimitri P. Bertsekas
    Relaxation Methods for Monotropic Programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:127-151 [Journal]
    
15. Paul Tseng, Dimitri P. Bertsekas
    On the convergence of the exponential multiplier method for convex programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:1-19 [Journal]
    
16. Paul Tseng, Zhi-Quan Luo
    On the convergence of the affine-scaling algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:56, n:, pp:301-319 [Journal]
    
17. Mihai Anitescu, Paul Tseng, Stephen J. Wright
    Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:2, pp:337-371 [Journal]
    
18. Dimitri P. Bertsekas, Paul Tseng
    Set Intersection Theorems and Existence of Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:2, pp:287-314 [Journal]