A simple polynomial-time algorithm for convex quadratic programming
Caption title.
Other Authors: | Tseng, Paul. |
---|---|
Language: | eng |
Published: |
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3092 |
Similar Items
-
Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem
Published: (2003) -
A very simple polynomial-time algorithm for linear programming
Published: (2003) -
Partial proximal minimization algorithms for convex programming
Published: (2003) -
Applications of a splitting algorithm to decomposition in convex programming and variational inequalities
Published: (2003) -
Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation
Published: (2003)