Paul Tseng

发表

Digital Object Identifier (DOI) 10.1007/s10107-006-0003-6

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 2004 .

Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search

Paul Tseng, Larry Nazareth, P. Tseng, 2002, Comput. Optim. Appl..

Fortified-Descent Simplicial Search Method: A General Approach

Paul Tseng, P. Tseng, 1999, SIAM J. Optim..

Some convex programs without a duality gap

Paul Tseng, 2009, Math. Program..

On the convergence of the exponential multiplier method for convex programming

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1993, Math. Program..

An ε-relaxation method for separable convex cost generalized network flow problems

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 2000, Math. Program..

Objective-derivative-free methods for constrained optimization

Paul Tseng, Marco Sciandrone, Stefano Lucidi, 2002, Math. Program..

AN -OUT-OF-KILTER METHODFOR MONOTROPIC PROGRAMMING

Paul Tseng, P. Tseng, 2001 .

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm

Paul Tseng, P. Tseng, 1991, SIAM J. Optim..

Relaxation methods for problems with strictly convex separable costs and linear constraints

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1987, Math. Program..

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function

Paul Tseng, P. Tseng, 1992, Math. Program..

A coordinate gradient descent method for nonsmooth separable minimization

Paul Tseng, Sangwoon Yun, P. Tseng, 2008, Math. Program..

Exact Regularization of Convex Programs

Paul Tseng, Michael P. Friedlander, P. Tseng, 2007, SIAM J. Optim..

Relaxation Method for Large Scale Linear Programming Using Decomposition

Paul Tseng, P. Tseng, 1991, Math. Oper. Res..

Convex Relaxations of the Weighted Maxmin Dispersion Problem

Paul Tseng, Jason L. Loeppky, Xianfu Wang, 2013, SIAM J. Optim..

A first-order interior-point method for linearly constrained smooth optimization

Paul Tseng, Immanuel M. Bomze, Werner Schachinger, 2011, Math. Program..

On some interior-point algorithms for nonconvex quadratic optimization

Paul Tseng, Yinyu Ye, 2002, Math. Program..

Merit functions for semi-definite complemetarity problems

Paul Tseng, P. Tseng, 1998, Math. Program..

Control perspectives on numerical algorithms and matrix problems

Paul Tseng, 2008, Math. Comput..

A block coordinate gradient descent method for regularized convex separable optimization and covariance selection

Paul Tseng, Kim-Chuan Toh, Sangwoon Yun, 2011, Math. Program..

Convergence and Error Bound for Perturbation of Linear Programs

Paul Tseng, 1999, Comput. Optim. Appl..

A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1996, IPCO.

Optimal Communication Algorithms for Hypercubes

John N. Tsitsiklis, Paul Tseng, Dimitri P. Bertsekas, 1991, J. Parallel Distributed Comput..

A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training

Paul Tseng, Sangwoon Yun, P. Tseng, 2010, Comput. Optim. Appl..

Incrementally Updated Gradient Methods for Constrained and Regularized Optimization

Paul Tseng, Sangwoon Yun, P. Tseng, 2013, Journal of Optimization Theory and Applications.

Relaxation methods for monotropic programming problems

Paul Tseng, P. Tseng, 1986 .

A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization

Masao Fukushima, Paul Tseng, Zhi-Quan Luo, 2002, SIAM J. Optim..

Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition

Paul Tseng, P. Tseng, 1990, Math. Oper. Res..

Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach

Masao Fukushima, Paul Tseng, Nobuo Yamashita, 1996, SIAM J. Optim..

On a global error bound for a class of monotone affine variational inequality problems

Paul Tseng, Zhi-Quan Luo, P. Tseng, 1992, Oper. Res. Lett..

Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise

Paul Tseng, 2009, IEEE Transactions on Information Theory.

Book review

Paul Tseng, 2003, Optim. Methods Softw..

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

Paul Tseng, Jein-Shan Chen, P. Tseng, 2005, Math. Program..

Enhanced Fritz John Conditions for Convex Programming

Paul Tseng, Asuman E. Ozdaglar, Dimitri P. Bertsekas, 2006, SIAM J. Optim..

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints

Masao Fukushima, Paul Tseng, P. Tseng, 2002, SIAM J. Optim..

On the convergence of the affine-scaling algorithm

Paul Tseng, Zhi-Quan Luo, P. Tseng, 1992, Math. Program..

Convergence Properties of Dikin’s Affine Scaling Algorithm for Nonconvex Quadratic Minimization

Paul Tseng, 2004, J. Glob. Optim..

On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions

Paul Tseng, Zhi-Quan Luo, P. Tseng, 1996, J. Algorithms.

A stackelberg game approach to distributed spectrum management

Paul Tseng, Zhi-Quan Luo, Jong-Shi Pang, 2011, Math. Program..

Block coordinate relaxation methods for nonparamatric signal denoising

Paul Tseng, Sylvain Sardy, Andrew G. Bruce, 1998, Defense, Security, and Sensing.

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming

Paul Tseng, P. Tseng, 1990, Math. Program..

Analysis of nonsmooth vector-valued functions associated with second-order cones

Paul Tseng, Xin Chen, Jein-Shan Chen, 2004, Math. Program..

Block coordinate relaxation methods for nonparametric signal denoising with wavelet dictionaries

Paul Tseng, Sylvain Sardy, Andrew G. Bruce, 2000 .

Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem

Paul Tseng, Zhi-Quan Luo, P. Tseng, 1992, SIAM J. Optim..

Approximation accuracy, gradient methods, and error bound for structured convex optimization

Paul Tseng, P. Tseng, 2010, Math. Program..

An ε-Relaxation Method for Separable Convex Cost Network Flow Problems

Paul Tseng, Dimitri P. Bertsekas, Lazaros Polymenakos, 1997, SIAM J. Optim..

A Modified Forward-backward Splitting Method for Maximal Monotone Mappings 1

Paul Tseng, P. Tseng, 1998 .

Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization

Paul Tseng, P. Tseng, 2002, SIAM J. Optim..

Dual coordinate ascent methods for non-strictly convex minimization

Paul Tseng, P. Tseng, 1993, Math. Program..

Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities

Paul Tseng, P. Tseng, 1997, SIAM J. Optim..

Partial Proximal Minimization Algorithms for Convex Pprogramming

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1994, SIAM J. Optim..

Non-Interior continuation methods for solving semidefinite complementarity problems

Paul Tseng, Xin Chen, P. Tseng, 2003, Math. Program..

(Robust) Edge-based semidefinite programming relaxation of sensor network localization

Paul Tseng, Ting Kei Pong, 2011, Math. Program..

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints

Paul Tseng, Nikos D. Sidiropoulos, Zhi-Quan Luo, 2007, SIAM J. Optim..

Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints

Masao Fukushima, Paul Tseng, Koichi Nabetani, 2011, Comput. Optim. Appl..

Partial Affine-Scaling for Linearly Constrained Minimization

Paul Tseng, P. Tseng, 1995, Math. Oper. Res..

Relaxation Methods for Linear Programs

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1987, Math. Oper. Res..

Relaxation methods for monotropic programs

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1990, Math. Program..

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

Paul Tseng, Defeng Sun, Ting Kei Pong, 2013, SIAM J. Matrix Anal. Appl..

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum

Masao Fukushima, Paul Tseng, 2007, SIAM J. Optim..

Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning

Paul Tseng, Jieping Ye, Shuiwang Ji, 2010, SIAM J. Optim..

On the Convergence of the Products of Firmly Nonexpansive Mappings

Paul Tseng, P. Tseng, 1992, SIAM J. Optim..

Splitting Method for Linear Complementarity Problems

Paul Tseng, 2009, Encyclopedia of Optimization.

An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule

Paul Tseng, P. Tseng, 1998, SIAM J. Optim..

Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1991, Math. Oper. Res..

Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities

Paul Tseng, Mikhail V. Solodov, P. Tseng, 2000, Comput. Optim. Appl..

Bounded Linear Regularity, Strong CHIP, and CHIP are Distinct Properties

Paul Tseng, Heinz H. Bauschke, Jonathan M. Borwein, 2000 .

Robust wavelet denoising

Paul Tseng, Sylvain Sardy, Andrew G. Bruce, 2001, IEEE Trans. Signal Process..

Second-Order Cone Programming Relaxation of Sensor Network Localization

Paul Tseng, P. Tseng, 2007, SIAM J. Optim..

Convergence rate analysis of an asynchronous space decomposition method for convex Minimization

Paul Tseng, Xue-Cheng Tai, P. Tseng, 2001, Math. Comput..

Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems

Paul Tseng, Dimitri P. Bertsekas, D. Bertsekas, 1988, Oper. Res..

Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems

Paul Tseng, Xin Chen, Houduo Qi, 2003, SIAM J. Optim..

An Infeasible Path-Following Method for Monotone Complementarity Problems

Paul Tseng, P. Tseng, 1997, SIAM J. Optim..

Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set

Paul Tseng, Zhi-Quan Luo, 1993, SIAM J. Optim..

Co-NP-completeness of some matrix classification problems

Paul Tseng, P. Tseng, 2000, Math. Program..

An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods

Paul Tseng, P. Tseng, 2004, Math. Oper. Res..

On almost smooth functions and piecewise smooth functions

Paul Tseng, Liquin Qi, P. Tseng, 2007 .

Error Bounds for Regularized Complementarity Problems

Paul Tseng, P. Tseng, 1999 .

Efficient computation of multiple solutions in quasibrittle fracture analysis

Paul Tseng, Francis Tin-Loi, P. Tseng, 2003 .

Metric regularity, strong CHIP, and CHIP are distinct properties

Paul Tseng, Heinz H. Bauschke, Jonathan M. Borwein, 2000 .

Linearly constrained convex programming as unconstrained differentiable concave programming

Paul Tseng, 1995 .

Traffic Equilibrium: Link Flows, Path Flows and Weakly/Strongly Acyclic Solutions

Paul Tseng, Jane N. Hagstrom, J. N. Hagstrom, 2001 .

Block Coordinate Relaxation Methods for

Paul Tseng, Sylvain Sardy, P. Tseng, 2016 .

A simple complexity proof for a polynomial-time linear programming algorithm

Paul Tseng, P. Tseng, 1989 .