| 2011 | ||
|---|---|---|
| j46 | Koichi Nabetani, Paul Tseng, Masao Fukushima: Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints. Comp. Opt. and Appl. 48(3): 423-452 (2011) | |
| j45 | Paul Tseng, Immanuel M. Bomze, Werner Schachinger: A first-order interior-point method for linearly constrained smooth optimization. Math. Program. 127(2): 399-424 (2011) | |
| j44 | Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang: A stackelberg game approach to distributed spectrum management. Math. Program. 129(2): 197-224 (2011) | |
| j43 | Sangwoon Yun, Paul Tseng, Kim-Chuan Toh: A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. Math. Program. 129(2): 331-355 (2011) | |
| j42 | Ting Kei Pong, Paul Tseng: (Robust) Edge-based semidefinite programming relaxation of sensor network localization. Math. Program. 130(2): 321-358 (2011) | |
| 2010 | ||
| j41 | Paul Tseng, Sangwoon Yun: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comp. Opt. and Appl. 47(2): 179-206 (2010) | |
| j40 | Paul Tseng: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125(2): 263-295 (2010) | |
| j39 | Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye: Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning. SIAM Journal on Optimization 20(6): 3465-3489 (2010) | |
| 2009 | ||
| j38 | ||
| j37 | Paul Tseng, Sangwoon Yun: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1-2): 387-423 (2009) | |
| j36 | 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) | |
| r1 | Paul Tseng: Splitting Method for Linear Complementarity Problems. Encyclopedia of Optimization 2009: 3659-3662 | |
| 2008 | ||
| j35 | Paul Tseng: Control perspectives on numerical algorithms and matrix problems. Math. Comput. 77(261): 609-610 (2008) | |
| 2007 | ||
| j34 | Dimitri P. Bertsekas, Paul Tseng: Set Intersection Theorems and Existence of Optimal Solutions. Math. Program. 110(2): 287-314 (2007) | |
| j33 | 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) | |
| j32 | Masao Fukushima, Paul Tseng: An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum. SIAM Journal on Optimization 17(4): 1253-1257 (2007) | |
| j31 | Zhi-Quan Luo, Nicholas D. Sidiropoulos, Paul Tseng, Shuzhong Zhang: Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints. SIAM Journal on Optimization 18(1): 1-28 (2007) | |
| j30 | Paul Tseng: Second-Order Cone Programming Relaxation of Sensor Network Localization. SIAM Journal on Optimization 18(1): 156-185 (2007) | |
| j29 | Michael P. Friedlander, Paul Tseng: Exact Regularization of Convex Programs. SIAM Journal on Optimization 18(4): 1326-1350 (2007) | |
| 2006 | ||
| j28 | Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng: Enhanced Fritz John Conditions for Convex Programming. SIAM Journal on Optimization 16(3): 766-797 (2006) | |
| 2005 | ||
| j27 | 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 | ||
| j26 | Paul Tseng: An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods. Math. Oper. Res. 29(1): 27-44 (2004) | |
| j25 | 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 | ||
| j24 | Xin Chen, Paul Tseng: Non-Interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95(3): 431-474 (2003) | |
| j23 | Xin Chen, Houduo Qi, Paul Tseng: Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems. SIAM Journal on Optimization 13(4): 960-985 (2003) | |
| j22 | Masao Fukushima, Zhi-Quan Luo, Paul Tseng: A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization. SIAM Journal on Optimization 13(4): 1098-1119 (2003) | |
| j21 | Paul Tseng: Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation. SIAM Journal on Optimization 14(1): 268-283 (2003) | |
| 2002 | ||
| j20 | Larry Nazareth, Paul Tseng: Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search. Comp. Opt. and Appl. 22(1): 133-144 (2002) | |
| j19 | Xue-Cheng Tai, Paul Tseng: Convergence rate analysis of an asynchronous space decomposition method for convex Minimization. Math. Comput. 71(239): 1105-1135 (2002) | |
| j18 | Paul Tseng, Yinyu Ye: On some interior-point algorithms for nonconvex quadratic optimization. Math. Program. 93(2): 217-225 (2002) | |
| j17 | Masao Fukushima, Zhi-Quan Luo, Paul Tseng: Smoothing Functions for Second-Order-Cone Complementarity Problems. SIAM Journal on Optimization 12(2): 436-460 (2002) | |
| j16 | Masao Fukushima, Paul Tseng: An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints. SIAM Journal on Optimization 12(3): 724-739 (2002) | |
| j15 | Paul Tseng: Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization. SIAM Journal on Optimization 13(2): 432-469 (2002) | |
| 2001 | ||
| j14 | Paul Tseng: An epsilon-out-of-Kilter Method for Monotropic Programming. Math. Oper. Res. 26(2): 221-233 (2001) | |
| j13 | Sylvain Sardy, Paul Tseng, Andrew G. Bruce: Robust wavelet denoising. IEEE Transactions on Signal Processing 49(6): 1146-1152 (2001) | |
| 2000 | ||
| j12 | Michael V. Solodov, Paul Tseng: Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities. Comp. Opt. and Appl. 17(2-3): 255-277 (2000) | |
| j11 | Paul Tseng: A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings. SIAM J. Control and Optimization 38(2): 431-446 (2000) | |
| 1999 | ||
| j10 | Paul Tseng: Fortified-Descent Simplicial Search Method: A General Approach. SIAM Journal on Optimization 10(1): 269-288 (1999) | |
| 1998 | ||
| j9 | Paul Tseng: Merit functions for semi-definite complementarity problems. Math. Program. 83: 159-185 (1998) | |
| 1996 | ||
| j8 | 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) | |
| c1 | Paul Tseng, Dimitri P. Bertsekas: A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. IPCO 1996: 85-93 | |
| 1993 | ||
| j7 | Paul Tseng: Dual coordinate ascent methods for non-strictly convex minimization. Math. Program. 59: 231-247 (1993) | |
| j6 | Paul Tseng, Dimitri P. Bertsekas: On the convergence of the exponential multiplier method for convex programming. Math. Program. 60: 1-19 (1993) | |
| 1992 | ||
| j5 | Paul Tseng: Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. Math. Program. 53: 297-306 (1992) | |
| j4 | Paul Tseng, Zhi-Quan Luo: On the convergence of the affine-scaling algorithm. Math. Program. 56: 301-319 (1992) | |
| 1991 | ||
| j3 | 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 | ||
| j2 | Paul Tseng, Dimitri P. Bertsekas: Relaxation Methods for Monotropic Programs. Math. Program. 46: 127-151 (1990) | |
| j1 | Paul Tseng: Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming. Math. Program. 48: 249-263 (1990) | |
Colors in the list of coauthors
Last update Sat May 25 21:07:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page