Tseng Paul

Paul Tseng

Information about the author Paul Tseng will soon be added to the site.
Found 20 papers in total
Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
2011
We consider the generalized Nash equilibrium problem (GNEP), in which each...
Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization
Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization
2004
We study convergence properties of Dikin's affine scaling algorithm applied to...
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
2010
Support vector machines (SVMs) training may be posed as a large quadratic program (QP)...
An analysis of the EM algorithm and entropy-like proximal point methods
An analysis of the EM algorithm and entropy-like proximal point methods
2004
The EM algorithm is a popular method for maximum likelihood estimation from incomplete...
Convergence and error bound for perturbation of linear programs
Convergence and error bound for perturbation of linear programs
1999
In various penalty/smoothing approaches to solving a linear program, one regularizes...
Merit functions for semi-definite complementarity problems
Merit functions for semi-definite complementarity problems
1998
Merit functions such as the gap function, the regularized gap function, the implicit...
Dual coordinate ascent methods for non-strictly convex minimization
Dual coordinate ascent methods for non-strictly convex minimization
1993
The paper considers a dual method for solving non-strictly convex programs possessing...
On the convergence of the exponential multiplier method for convex programming
On the convergence of the exponential multiplier method for convex programming
1993
In this paper, the authors analyze the exponential method of multipliers for convex...
On the convergence rate of dual ascent methods for linearly constrained convex minimization
On the convergence rate of dual ascent methods for linearly constrained convex minimization
1993
The authors analyze the rate of convergence of certain dual ascent methods for the...
Error bounds and convergence analysis of feasible descent methods: A general approach
Error bounds and convergence analysis of feasible descent methods: A general approach
1993
The authors survey and extend a general approach to analyzing the convergence and the...
On a global error bound for a class of monotone affine variational inequality problems
On a global error bound for a class of monotone affine variational inequality problems
1992
The authors give, for a class of monotone affine variational inequality problems, a...
On the convergence of the affine-scaling algorithm
On the convergence of the affine-scaling algorithm
1992
The affine-scaling algorithm, first proposed by Dikin, is presently enjoying great...
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
1992
The paper considers a path following algorithm for solving linear complementarity...
Relaxation method for large scale linear programming using decomposition
Relaxation method for large scale linear programming using decomposition
1991
The paper proposes a new decomposition method for large-scale linear programming. This...
Relaxation methods for problems with strictly convex costs and linear constraints
Relaxation methods for problems with strictly convex costs and linear constraints
1991
Consider the problem of minimizing a strictly convex (possibly nondifferentiable and...
Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
1990
A classical method for solving the variational inequality problem is the projection...
Relaxation methods for monotropic programs
Relaxation methods for monotropic programs
1990
The authors propose a dual descent method for the problem of minimizing a convex,...
Solving H-horizon, stationary Markov decision problems in time proportional to log(H).
Solving H-horizon, stationary Markov decision problems in time proportional to log(H).
1990
The paper considers the H-horizon, stationary Markov decision problem. For the...
A simple complexity proof for a polynomial-time linear programming algorithm
A simple complexity proof for a polynomial-time linear programming algorithm
1989
In this article a polynomial-time algorithm for linear programming is proposed. This...
The relax codes for linear minimum cost network flow problems
The relax codes for linear minimum cost network flow problems
1988
The authors describe a relaxation algorithm for solving the classical minimum cost...
Papers per page: