| Year |
Citation |
Score |
| 2014 |
Tseng P, Yun S. Incrementally Updated Gradient Methods for Constrained and Regularized Optimization Journal of Optimization Theory and Applications. 160: 832-853. DOI: 10.1007/S10957-013-0409-2 |
0.661 |
|
| 2013 |
Haines S, Loeppky J, Tseng P, Wang X. Convex relaxations of the weighted maxmin dispersion problem Siam Journal On Optimization. 23: 2264-2294. DOI: 10.1137/120888880 |
0.468 |
|
| 2013 |
Maryam F, Pong TK, Sun D, Tseng P. Hankel matrix rank minimization with applications to system identification and realization Siam Journal On Matrix Analysis and Applications. 34: 946-977. DOI: 10.1137/110853996 |
0.54 |
|
| 2012 |
Neto D, Sardy S, Tseng P. ℓ1-Penalized Likelihood Smoothing and Segmentation of Volatility Processes Allowing for Abrupt Changes Journal of Computational and Graphical Statistics. 21: 217-233. DOI: 10.1198/Jcgs.2011.10081 |
0.37 |
|
| 2011 |
Nabetani K, Tseng P, Fukushima M. Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints Computational Optimization and Applications. 48: 423-452. DOI: 10.1007/S10589-009-9256-3 |
0.445 |
|
| 2011 |
Yun S, Tseng P, Toh K. A block coordinate gradient descent method for regularized convex separable optimization and covariance selection Mathematical Programming. 129: 331-355. DOI: 10.1007/S10107-011-0471-1 |
0.716 |
|
| 2011 |
Pong TK, Tseng P. (Robust) Edge-based semidefinite programming relaxation of sensor network localization Mathematical Programming. 130: 321-358. DOI: 10.1007/S10107-009-0338-X |
0.394 |
|
| 2011 |
Tseng P, Bomze IM, Schachinger W. A first-order interior-point method for linearly constrained smooth optimization Mathematical Programming. 127: 399-424. DOI: 10.1007/S10107-009-0292-7 |
0.524 |
|
| 2010 |
Pong TK, Tseng P, Ji S, Ye J. Trace norm regularization: Reformulations, algorithms, and multi-task learning Siam Journal On Optimization. 20: 3465-3489. DOI: 10.1137/090763184 |
0.498 |
|
| 2010 |
Sardy S, Tseng P. Density Estimation by Total Variation Penalized Likelihood Driven by the Sparsity ℓ1 Information Criterion Scandinavian Journal of Statistics. 37: 321-337. DOI: 10.1111/J.1467-9469.2009.00672.X |
0.337 |
|
| 2010 |
Tseng P, Yun S. A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training Computational Optimization and Applications. 47: 179-206. DOI: 10.1007/S10589-008-9215-4 |
0.648 |
|
| 2010 |
Tseng P. Approximation accuracy, gradient methods, and error bound for structured convex optimization Mathematical Programming. 125: 263-295. DOI: 10.1007/S10107-010-0394-2 |
0.524 |
|
| 2009 |
Tseng P, Yun S. Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization Journal of Optimization Theory and Applications. 140: 513-535. DOI: 10.1007/S10957-008-9458-3 |
0.668 |
|
| 2009 |
Tseng P, Yun S. A coordinate gradient descent method for nonsmooth separable minimization Mathematical Programming. 117: 387-423. DOI: 10.1007/S10107-007-0170-0 |
0.702 |
|
| 2009 |
Tseng P. Some convex programs without a duality gap Mathematical Programming. 116: 553-578. DOI: 10.1007/S10107-007-0110-Z |
0.395 |
|
| 2008 |
Tseng P. Book Review: Control perspectives on numerical algorithms and matrix problems Mathematics of Computation. 77: 609-610. DOI: 10.1090/S0025-5718-07-02053-4 |
0.385 |
|
| 2007 |
Friedlander MP, Tseng P. Exact regularization of convex programs Siam Journal On Optimization. 18: 1326-1350. DOI: 10.1137/060675320 |
0.497 |
|
| 2007 |
Luo ZQ, Sidiropoulos ND, Tseng P, Zhang S. Approximation bounds for quadratic optimization with homogeneous quadratic constraints Siam Journal On Optimization. 18: 1-28. DOI: 10.1137/050642691 |
0.447 |
|
| 2007 |
Tseng P. Second-order cone programming relaxation of sensor network localization Siam Journal On Optimization. 18: 156-185. DOI: 10.1137/050640308 |
0.431 |
|
| 2007 |
Qi L, Tseng P. On almost smooth functions and piecewise smooth functions Nonlinear Analysis, Theory, Methods and Applications. 67: 773-794. DOI: 10.1016/J.Na.2006.06.029 |
0.347 |
|
| 2007 |
Anitescu M, Tseng P, Wright SJ. Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties Mathematical Programming. 110: 337-371. DOI: 10.1007/S10107-006-0005-4 |
0.469 |
|
| 2007 |
Bertsekas DP, Tseng P. Set intersection theorems and existence of optimal solutions Mathematical Programming. 110: 287-314. DOI: 10.1007/S10107-006-0003-6 |
0.646 |
|
| 2006 |
Bertsekas DP, Ozdaglar AE, Tseng P. Enhanced Fritz John Conditions for Convex Programming Siam Journal On Optimization. 16: 766-797. DOI: 10.1137/040613068 |
0.66 |
|
| 2006 |
Ozdaglar AE, Tseng P. Existence of global minima for constrained optimization Journal of Optimization Theory and Applications. 128: 523-546. DOI: 10.1007/S10957-006-9039-2 |
0.494 |
|
| 2005 |
Chen JS, Tseng P. An unconstrained smooth minimization reformulation of the second-order cone complementarity problem Mathematical Programming. 104: 293-327. DOI: 10.1007/S10107-005-0617-0 |
0.576 |
|
| 2004 |
Tseng P. An analysis of the EM algorithm and entropy-like proximal point methods Mathematics of Operations Research. 29: 27-44. DOI: 10.1287/Moor.1030.0073 |
0.454 |
|
| 2004 |
Sardy S, Tseng P. AMlet, RAMlet, and GAMlet: Automatic nonlinear fitting of additive models, robust and generalized, with wavelets Journal of Computational and Graphical Statistics. 13: 283-309. DOI: 10.1198/1061860043434 |
0.417 |
|
| 2004 |
Sardy S, Antoniadis A, Tseng P. Automatic Smoothing With Wavelets for a Wide Class of Distributions Journal of Computational and Graphical Statistics. 13: 399-421. DOI: 10.1198/1061860043399 |
0.346 |
|
| 2004 |
Sardy S, Tseng P. On the statistical analysis of smoothing by maximizing dirty Markov random field posterior distributions Journal of the American Statistical Association. 99: 191-204. DOI: 10.1198/016214504000000188 |
0.312 |
|
| 2004 |
Tseng P. Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation Siam Journal On Optimization. 14: 268-283. DOI: 10.1137/S1052623401395899 |
0.398 |
|
| 2004 |
Tseng P. Convergence properties of dikin's affine scaling algorithm for nonconvex quadratic minimization Journal of Global Optimization. 30: 285-300. DOI: 10.1007/S10898-004-8276-X |
0.41 |
|
| 2004 |
Chen J, Chen X, Tseng P. Analysis of nonsmooth vector-valued functions associated with second-order cones Mathematical Programming. 101. DOI: 10.1007/S10107-004-0538-3 |
0.333 |
|
| 2003 |
Fukushima M, Luo Z, Tseng P. A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization Siam Journal On Optimization. 13: 1098-1119. DOI: 10.1137/S1052623401398120 |
0.533 |
|
| 2003 |
Chen X, Qi H, Tseng P. Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems Siam Journal On Optimization. 13: 960-985. DOI: 10.1137/S1052623400380584 |
0.431 |
|
| 2003 |
Gottlieb D, Gottlieb S, Tseng P. Book Review: High-order methods for incompressible fluid flow@@@Book Review: Lectures on modern convex optimization: analysis, algorithms and engineering applications Mathematics of Computation. 73: 1039-1041. DOI: 10.1090/S0025-5718-03-01670-3 |
0.348 |
|
| 2003 |
Tin-Loi F, Tseng P. Efficient computation of multiple solutions in quasibrittle fracture analysis Computer Methods in Applied Mechanics and Engineering. 192: 1377-1388. DOI: 10.1016/S0045-7825(02)00645-X |
0.384 |
|
| 2003 |
Chen X, Tseng P. Non-interior continuation methods for solving semidefinite complementarity problems Mathematical Programming, Series B. 95: 431-474. DOI: 10.1007/S10107-002-0306-1 |
0.554 |
|
| 2002 |
Fukushima M, Tseng P. An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints Siam Journal On Optimization. 12: 724-739. DOI: 10.1137/S1052623499363232 |
0.451 |
|
| 2002 |
Fukushima M, Luo ZQ, Tseng P. Smoothing functions for second-order-cone complementarity problems Siam Journal On Optimization. 12: 436-460. DOI: 10.1137/S1052623400380365 |
0.512 |
|
| 2002 |
Tai XC, Tseng P. Convergence rate analysis of an asynchronous space decomposition method for convex minimization Mathematics of Computation. 71: 1105-1135. DOI: 10.1090/S0025-5718-01-01344-8 |
0.461 |
|
| 2002 |
Guerriero F, Tseng P. Implementation and test of auction methods for solving generalized network flow problems with separable convex cost Journal of Optimization Theory and Applications. 115: 113-144. DOI: 10.1023/A:1019629113986 |
0.494 |
|
| 2002 |
Nazareth L, Tseng P. Gilding the lily: A variant of the Nelder-Mead algorithm based on golden-section search Computational Optimization and Applications. 22: 133-144. DOI: 10.1023/A:1014842520519 |
0.336 |
|
| 2002 |
Lucidi S, Sciandrone M, Tseng P. Objective-derivative-free methods for constrained optimization Mathematical Programming. 92: 37-59. DOI: 10.1007/S101070100266 |
0.45 |
|
| 2002 |
Tseng P, Ye Y. On some interior-point algorithms for nonconvex quadratic optimization Mathematical Programming, Series B. 93: 217-225. DOI: 10.1007/S10107-002-0310-5 |
0.414 |
|
| 2001 |
Tseng P. An e-out-of-Kilter Method for Monotropic Programming Mathematics of Operations Research. 26: 221-233. DOI: 10.1287/Moor.26.2.221.10557 |
0.404 |
|
| 2001 |
Sardy S, Tseng P, Bruce AG. Robust wavelet denoising Ieee Transactions On Signal Processing. 49: 1146-1152. DOI: 10.1109/78.923297 |
0.338 |
|
| 2001 |
Tseng P. Convergence of a block coordinate descent method for nondifferentiable minimization Journal of Optimization Theory and Applications. 109: 475-494. DOI: 10.1023/A:1017501703105 |
0.389 |
|
| 2000 |
Tseng P. A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings Siam Journal On Control and Optimization. 38: 431-446. DOI: 10.1137/S0363012998338806 |
0.409 |
|
| 2000 |
Sardy S, Bruce AG, Tseng P. Block Coordinate Relaxation Methods for Nonparametric Wavelet Denoising Journal of Computational and Graphical Statistics. 9: 361-379. DOI: 10.1080/10618600.2000.10474885 |
0.469 |
|
| 2000 |
Solodov MV, Tseng P. Some methods based on the D-gap function for solving monotone variational inequalities Computational Optimization and Applications. 17: 255-277. DOI: 10.1023/A:1026506516738 |
0.463 |
|
| 2000 |
Tseng P. Nearest q -flat to m points Journal of Optimization Theory and Applications. 105: 249-252. DOI: 10.1023/A:1004678431677 |
0.385 |
|
| 2000 |
Tseng P. Co-NP-completeness of some matrix classification problems Mathematical Programming. 88: 183-192. DOI: 10.1007/S101070000159 |
0.416 |
|
| 2000 |
Tseng P, Bertsekas DP. An E-Relaxation Method For Separable Convex Cost Generalized Network Flow Problems' Mathematical Programming. 88: 85-104. DOI: 10.1007/Pl00011379 |
0.63 |
|
| 1999 |
Tseng P. Fortified-Descent Simplicial Search Method: A General Approach Siam Journal On Optimization. 10: 269-288. DOI: 10.1137/S1052623495282857 |
0.384 |
|
| 1999 |
Tseng P. Convergence and Error Bound for Perturbation of Linear Programs Computational Optimization and Applications. 13: 221-230. DOI: 10.1023/A:1008625410523 |
0.517 |
|
| 1998 |
Bruce AG, Sardy S, Tseng P. Block coordinate relaxation methods for nonparamatric signal denoising Proceedings of Spie. 3391: 75-86. DOI: 10.1117/12.304915 |
0.461 |
|
| 1998 |
Tseng P. Merit functions for semi-definite complementarity problems Mathematical Programming. 83: 159-185. DOI: 10.1007/Bf02680556 |
0.484 |
|
| 1997 |
Bertsekas DP, Polymenakos LC, Tseng P. An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems Siam Journal On Optimization. 7: 853-870. DOI: 10.1137/S1052623495285886 |
0.7 |
|
| 1997 |
Luo X, Tseng P. On a global projection-type error bound for the linear complementarity problem Linear Algebra and Its Applications. 253: 251-278. DOI: 10.1016/0024-3795(95)00707-5 |
0.373 |
|
| 1996 |
Tseng P, Yamashita N, Fukushima M. Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach Siam Journal On Optimization. 6: 446-460. DOI: 10.1137/0806024 |
0.499 |
|
| 1996 |
Burke JV, Tseng P. A Unified Analysis Of Hoffman'S Bound Via Fenchel Duality* Siam Journal On Optimization. 6: 265-282. DOI: 10.1137/0806015 |
0.391 |
|
| 1996 |
Tseng P. Growth behavior of a class of merit functions for the nonlinear complementarity problem Journal of Optimization Theory and Applications. 89: 17-37. DOI: 10.1007/Bf02192639 |
0.405 |
|
| 1996 |
Tseng P, Luo ZQ. On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions Journal of Algorithms. 21: 240-266. DOI: 10.1006/Jagm.1996.0045 |
0.425 |
|
| 1995 |
Tseng P. Partial affine-scaling for linearly constrained minimization Mathematics of Operations Research. 20: 678-694. DOI: 10.1287/Moor.20.3.678 |
0.462 |
|
| 1995 |
Tseng P. On linear convergence of iterative methods for the variational inequality problem Journal of Computational and Applied Mathematics. 60: 237-252. DOI: 10.1016/0377-0427(94)00094-H |
0.496 |
|
| 1995 |
Tseng P. Linearly constrained convex programming as unconstrained differentiable concave programming Journal of Optimization Theory and Applications. 85: 489-494. DOI: 10.1007/Bf02192238 |
0.387 |
|
| 1994 |
Luo Z, Tseng P. Perturbation Analysis of a Condition Number for Linear Systems Siam Journal On Matrix Analysis and Applications. 15: 636-660. DOI: 10.1137/S0895479892224768 |
0.448 |
|
| 1993 |
Luo Z, Tseng P. On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization Mathematics of Operations Research. 18: 846-867. DOI: 10.1287/Moor.18.4.846 |
0.557 |
|
| 1993 |
Luo Z, Tseng P. Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set Siam Journal On Optimization. 3: 43-59. DOI: 10.1137/0803003 |
0.451 |
|
| 1993 |
Luo ZQ, Tseng P. Error bounds and convergence analysis of feasible descent methods: a general approach Annals of Operations Research. 46: 157-178. DOI: 10.1007/Bf02096261 |
0.449 |
|
| 1993 |
Tseng P. Dual coordinate ascent methods for non-strictly convex minimization Mathematical Programming. 59: 231-247. DOI: 10.1007/Bf01581245 |
0.453 |
|
| 1993 |
Tseng P, Bertsekas DP. On the convergence of the exponential multiplier method for convex programming Mathematical Programming. 60: 1-19. DOI: 10.1007/Bf01580598 |
0.696 |
|
| 1992 |
Tseng P. On the Convergence of the Products of Firmly Nonexpansive Mappings Siam Journal On Optimization. 2: 425-434. DOI: 10.1137/0802021 |
0.331 |
|
| 1992 |
Luo Z, Tseng P. Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem Siam Journal On Optimization. 2: 43-54. DOI: 10.1137/0802004 |
0.521 |
|
| 1992 |
Luo Z, Tseng P. On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization Siam Journal On Control and Optimization. 30: 408-425. DOI: 10.1137/0330025 |
0.585 |
|
| 1992 |
Luo ZQ, Tseng P. On a global error bound for a class of monotone affine variational inequality problems Operations Research Letters. 11: 159-165. DOI: 10.1016/0167-6377(92)90080-M |
0.492 |
|
| 1992 |
Tseng P. Complexity analysis of a linear complementarity algorithm based on a Lyapunov function Mathematical Programming. 53: 297-306. DOI: 10.1007/Bf01585708 |
0.456 |
|
| 1992 |
Tseng P, Luo ZQ. On the convergence of the affine-scaling algorithm Mathematical Programming. 56: 301-319. DOI: 10.1007/Bf01580904 |
0.484 |
|
| 1992 |
Tseng P. Global linear convergence of a path-following algorithm for some monotone variational inequality problems Journal of Optimization Theory and Applications. 75: 265-279. DOI: 10.1007/Bf00941467 |
0.505 |
|
| 1992 |
Luo ZQ, Tseng P. On the convergence of the coordinate descent method for convex differentiable minimization Journal of Optimization Theory and Applications. 72: 7-35. DOI: 10.1007/Bf00939948 |
0.567 |
|
| 1991 |
Tseng P. Relaxation method for large scale linear programming using decomposition Mathematics of Operations Research. 16: 859-880. DOI: 10.1287/Moor.16.4.859 |
0.477 |
|
| 1991 |
Tseng P, Bertsekas DP. Relaxation methods for problems with strictly convex costs and linear constraints Mathematics of Operations Research. 16: 462-481. DOI: 10.1287/Moor.16.3.462 |
0.692 |
|
| 1991 |
Tseng P. On The Rate Of Convergence Of A Partially Asynchronous Gradient Projection Algorithm Siam Journal On Optimization. 1: 603-619. DOI: 10.1137/0801036 |
0.466 |
|
| 1991 |
Bertsekas DP, Özveren C, Stamoulis GD, Tseng P, Tsitsiklis JN. Optimal communication algorithms for hypercubes Journal of Parallel and Distributed Computing. 11: 263-275. DOI: 10.1016/0743-7315(91)90033-6 |
0.651 |
|
| 1991 |
Tseng P. Descent methods for convex essentially smooth minimization Journal of Optimization Theory and Applications. 71: 425-463. DOI: 10.1007/Bf00941397 |
0.574 |
|
| 1991 |
Tseng P. Decomposition algorithm for convex differentiable minimization Journal of Optimization Theory and Applications. 70: 109-135. DOI: 10.1007/Bf00940507 |
0.481 |
|
| 1990 |
Tseng P. Distributed computation for linear programming problems satisfying a certain diagonal dominance condition Mathematics of Operations Research. 15: 33-48. DOI: 10.1287/Moor.15.1.33 |
0.525 |
|
| 1990 |
Tseng P, Bertsekas DP, Tsitsiklis JN. Partially asynchronous, parallel algorithms for network flow and other problems Siam Journal On Control and Optimization. 28: 678-710. DOI: 10.1137/0328040 |
0.677 |
|
| 1990 |
Tseng P. Solving H-horizon, stationary Markov decision problems in time proportional to log(H) Operations Research Letters. 9: 287-297. DOI: 10.1016/0167-6377(90)90022-W |
0.392 |
|
| 1990 |
Tseng P, Bertsekas DP. Relaxation methods for monotropic programs Mathematical Programming. 46: 127-151. DOI: 10.1007/Bf01585734 |
0.691 |
|
| 1990 |
Tseng P. Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming Mathematical Programming. 48: 249-263. DOI: 10.1007/Bf01582258 |
0.513 |
|
| 1989 |
Tseng P. A simple complexity proof for a polynomial-time linear programming algorithm Operations Research Letters. 8: 155-159. DOI: 10.1016/0167-6377(89)90042-4 |
0.408 |
|
| 1988 |
Bertsekas DP, Tseng P. The relax codes for linear minimum cost network flow problems Annals of Operations Research. 13: 125-190. DOI: 10.1007/Bf02288322 |
0.635 |
|
| 1987 |
Tseng P, Bertsekas DP. Relaxation methods for problems with strictly convex separable costs and linear constraints Mathematical Programming. 38: 303-321. DOI: 10.1007/Bf02592017 |
0.714 |
|
| Show low-probability matches. |