Paul Tseng - RankMe

81 papers B 1Journal 78

Year	Rank	Type	Title / Venue / Authors
2014	J	`jnl`	Incrementally Updated Gradient Methods for Constrained and Regularized Optimization. J. Optim. Theory Appl. Paul Tseng, Sangwoon Yun
2013	J	`jnl`	Convex Relaxations of the Weighted Maxmin Dispersion Problem. SIAM J. Optim. Sheena Haines, Jason L. Loeppky, Paul Tseng, Xianfu Wang
2013	J	`jnl`	Hankel Matrix Rank Minimization with Applications to System Identification and Realization. SIAM J. Matrix Anal. Appl. Maryam Fazel, Ting Kei Pong, Defeng Sun, Paul Tseng
2011	J	`jnl`	(Robust) Edge-based semidefinite programming relaxation of sensor network localization. Math. Program. Ting Kei Pong, Paul Tseng
2011	J	`jnl`	A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. Math. Program. Sangwoon Yun, Paul Tseng, Kim-Chuan Toh
2011	J	`jnl`	A first-order interior-point method for linearly constrained smooth optimization. Math. Program. Paul Tseng, Immanuel M. Bomze, Werner Schachinger
2011	J	`jnl`	A stackelberg game approach to distributed spectrum management. Math. Program. Meisam Razaviyayn, Zhi-Quan Luo, Paul Tseng, Jong-Shi Pang
2011	J	`jnl`	Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints. Comput. Optim. Appl. Koichi Nabetani, Paul Tseng, Masao Fukushima
2010	J	`jnl`	A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. Paul Tseng, Sangwoon Yun
2010	J	`jnl`	Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. Paul Tseng
2010	J	`jnl`	Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning. SIAM J. Optim. Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
2009	J	`jnl`	A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. Paul Tseng, Sangwoon Yun
2009	J	`jnl`	Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise. IEEE Trans. Inf. Theory Paul Tseng
2009	J	`jnl`	Some convex programs without a duality gap. Math. Program. Paul Tseng
2009	—	`ch.`	Splitting Method for Linear Complementarity Problems. Encyclopedia of Optimization Paul Tseng
2008	J	`jnl`	Control perspectives on numerical algorithms and matrix problems. Math. Comput. Paul Tseng
2007	J	`jnl`	An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum. SIAM J. Optim. Masao Fukushima, Paul Tseng
2007	J	`jnl`	Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints. SIAM J. Optim. Zhi-Quan Luo, Nicholas D. Sidiropoulos, Paul Tseng, Shuzhong Zhang
2007	J	`jnl`	Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. Math. Program. Mihai Anitescu, Paul Tseng, Stephen J. Wright
2007	J	`jnl`	Exact Regularization of Convex Programs. SIAM J. Optim. Michael P. Friedlander, Paul Tseng
2007	J	`jnl`	Second-Order Cone Programming Relaxation of Sensor Network Localization. SIAM J. Optim. Paul Tseng
2007	J	`jnl`	Set Intersection Theorems and Existence of Optimal Solutions. Math. Program. Dimitri P. Bertsekas, Paul Tseng
2006	J	`jnl`	Enhanced Fritz John Conditions for Convex Programming. SIAM J. Optim. Dimitri P. Bertsekas, Asuman E. Ozdaglar, Paul Tseng
2005	J	`jnl`	An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. Math. Program. Jein-Shan Chen, Paul Tseng
2004	J	`jnl`	An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods. Math. Oper. Res. Paul Tseng
2004	J	`jnl`	Analysis of nonsmooth vector-valued functions associated with second-order cones. Math. Program. Jein-Shan Chen, Xin Chen, Paul Tseng
2004	J	`jnl`	Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization. J. Glob. Optim. Paul Tseng
2003	J	`jnl`	A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization. SIAM J. Optim. Masao Fukushima, Zhi-Quan Luo, Paul Tseng
2003	J	`jnl`	Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems. SIAM J. Optim. Xin Chen, Houduo Qi, Paul Tseng
2003	J	`jnl`	Book review. Optim. Methods Softw. Paul Tseng
2003	J	`jnl`	Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation. SIAM J. Optim. Paul Tseng
2003	J	`jnl`	Non-Interior continuation methods for solving semidefinite complementarity problems. Math. Program. Xin Chen, Paul Tseng
2002	J	`jnl`	An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints. SIAM J. Optim. Masao Fukushima, Paul Tseng
2002	J	`jnl`	Convergence rate analysis of an asynchronous space decomposition method for convex Minimization. Math. Comput. Xue-Cheng Tai, Paul Tseng
2002	J	`jnl`	Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization. SIAM J. Optim. Paul Tseng
2002	J	`jnl`	Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search. Comput. Optim. Appl. Larry Nazareth, Paul Tseng
2002	J	`jnl`	Objective-derivative-free methods for constrained optimization. Math. Program. Stefano Lucidi, Marco Sciandrone, Paul Tseng
2002	J	`jnl`	On some interior-point algorithms for nonconvex quadratic optimization. Math. Program. Paul Tseng, Yinyu Ye
2002	J	`jnl`	Smoothing Functions for Second-Order-Cone Complementarity Problems. SIAM J. Optim. Masao Fukushima, Zhi-Quan Luo, Paul Tseng
2001	J	`jnl`	An epsilon-out-of-Kilter Method for Monotropic Programming. Math. Oper. Res. Paul Tseng
2001	J	`jnl`	Robust wavelet denoising. IEEE Trans. Signal Process. Sylvain Sardy, Paul Tseng, Andrew G. Bruce
2000	J	`jnl`	A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings. SIAM J. Control. Optim. Paul Tseng
2000	J	`jnl`	An ε-relaxation method for separable convex cost generalized network flow problems. Math. Program. Paul Tseng, Dimitri P. Bertsekas
2000	J	`jnl`	Co-NP-completeness of some matrix classification problems. Math. Program. Paul Tseng
2000	J	`jnl`	Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities. Comput. Optim. Appl. Michael V. Solodov, Paul Tseng
1999	J	`jnl`	Convergence and Error Bound for Perturbation of Linear Programs. Comput. Optim. Appl. Paul Tseng
1999	J	`jnl`	Fortified-Descent Simplicial Search Method: A General Approach. SIAM J. Optim. Paul Tseng
1998	J	`jnl`	An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule. SIAM J. Optim. Paul Tseng
1998	J	`jnl`	Merit functions for semi-definite complementarity problems. Math. Program. Paul Tseng
1997	J	`jnl`	Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities. SIAM J. Optim. Paul Tseng
1997	J	`jnl`	An Infeasible Path-Following Method for Monotone Complementarity Problems. SIAM J. Optim. Paul Tseng
1997	J	`jnl`	An ε-Relaxation Method for Separable Convex Cost Network Flow Problems. SIAM J. Optim. Dimitri P. Bertsekas, Lazaros C. Polymenakos, Paul Tseng
1996	J	`jnl`	A Unified Analysis of Hoffman's Bound via Fenchel Duality. SIAM J. Optim. James V. Burke, Paul Tseng
1996	B	`conf`	A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. IPCO Paul Tseng, Dimitri P. Bertsekas
1996	J	`jnl`	Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach. SIAM J. Optim. Paul Tseng, Nobuo Yamashita, Masao Fukushima
1996	J	`jnl`	On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions. J. Algorithms Paul Tseng, Zhi-Quan Luo
1995	J	`jnl`	Partial Affine-Scaling for Linearly Constrained Minimization. Math. Oper. Res. Paul Tseng
1994	J	`jnl`	On the rate of convergence of a distributed asynchronous routing algorithm. IEEE Trans. Autom. Control. Zhi-Quan Luo, Paul Tseng
1994	J	`jnl`	Partial Proximal Minimization Algorithms for Convex Pprogramming. SIAM J. Optim. Dimitri P. Bertsekas, Paul Tseng
1994	J	`jnl`	Perturbation Analysis of a Condition Number for Linear Systems. SIAM J. Matrix Anal. Appl. Zhi-Quan Luo, Paul Tseng
1993	J	`jnl`	Dual coordinate ascent methods for non-strictly convex minimization. Math. Program. Paul Tseng
1993	J	`jnl`	Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set. SIAM J. Optim. Zhi-Quan Luo, Paul Tseng
1993	J	`jnl`	Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. Zhi-Quan Luo, Paul Tseng
1993	J	`jnl`	On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization. Math. Oper. Res. Zhi-Quan Luo, Paul Tseng
1993	J	`jnl`	On the convergence of the exponential multiplier method for convex programming. Math. Program. Paul Tseng, Dimitri P. Bertsekas
1992	J	`jnl`	Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. Math. Program. Paul Tseng
1992	J	`jnl`	Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem. SIAM J. Optim. Zhi-Quan Luo, Paul Tseng
1992	J	`jnl`	On a global error bound for a class of monotone affine variational inequality problems. Oper. Res. Lett. Zhi-Quan Luo, Paul Tseng
1992	J	`jnl`	On the Convergence of the Products of Firmly Nonexpansive Mappings. SIAM J. Optim. Paul Tseng
1992	J	`jnl`	On the convergence of the affine-scaling algorithm. Math. Program. Paul Tseng, Zhi-Quan Luo
1991	J	`jnl`	On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm. SIAM J. Optim. Paul Tseng
1991	J	`jnl`	Optimal Communication Algorithms for Hypercubes. J. Parallel Distributed Comput. Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis
1991	J	`jnl`	Relaxation Method for Large Scale Linear Programming Using Decomposition. Math. Oper. Res. Paul Tseng
1991	J	`jnl`	Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. Math. Oper. Res. Paul Tseng, Dimitri P. Bertsekas
1990	J	`jnl`	Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition. Math. Oper. Res. Paul Tseng
1990	J	`jnl`	Further Applications of a Splitting Algorithm to Decomposition in Variational Inequalities and Convex Programming. Math. Program. Paul Tseng
1990	J	`jnl`	Relaxation Methods for Monotropic Programs. Math. Program. Paul Tseng, Dimitri P. Bertsekas
1988	J	`jnl`	Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. Oper. Res. Dimitri P. Bertsekas, Paul Tseng
1987	J	`jnl`	Relaxation Methods for Linear Programs. Math. Oper. Res. Paul Tseng, Dimitri P. Bertsekas
1987	J	`jnl`	Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Program. Paul Tseng, Dimitri P. Bertsekas
1986	—	`—`	Relaxation methods for monotropic programming problems. Paul Tseng