Browsing by Author Tseng, Paul.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 20 of 40  next >
Issue DateTitleAuthor(s)
5-Jun-2013A decomposition algorithm for convex differentiable minimizationTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A path-following algorithm for linear programming using quadratic and logarithmic penalty functionsTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A simple polynomial-time algorithm for convex quadratic programmingTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013A very simple polynomial-time algorithm for linear programmingTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013An E-relaxation method for separable convex cost generalized network flow problemsTseng, Paul.; Bertsekas, Dimitri P.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013An e-relaxation method for separable convex cost network flow problemsBertsekas, Dimitri P.; Polymenakos, Lazaros.; Tseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Applications of a splitting algorithm to decomposition in convex programming and variational inequalitiesTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocationTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Complexity analysis of a linear complementarity algorithm based on a Lyapunov functionTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Convergence of asynchronous matrix iterations subject to diagonal dominanceTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Coordinate ascent for maximizing nondifferentiable concave functionsTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Distributed computation for linear programming problems satisfying certain diagonal dominance conditionTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approachTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013E-relaxation and auction method for separable convex cost network flow problemsBertsekas, Dimitri P.; Polymenakos, Lazaros.; Tseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problemTseng, Paul.; Luo, Zhi-Quan.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013Further applications of a splitting algorithm to decomposition in variational inequalities and convex programmingTseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013On computing the nested sums and infimal convolutions of convex piecewise-linear functionsTseng, Paul.; Luo, Zhi-Quan.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013On the convergence of a matrix splitting algorithm for the symmetric linear complementarity problemLuo, Zhi-Quan.; Tseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013On the convergence of the affine-scaling algorithmTseng, Paul.; Luo, Zhi-Quan.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013On the convergence of the coordinate descent method for convex differentiable minimizationLuo, Zhi-Quan.; Tseng, Paul.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.