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

Bibliography: p. 25-26.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Bertsekas

Successive projection under a quasi-cyclic order

Cover title.Includes bibliographical references (leaves 8-10).Research supported by the U.S. Army Research Office. DAAL03-86-K-0171by Paul Tseng

Coordinate ascent for maximizing nondifferentiable concave functions

Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office (Center for Intelligent Control Systems) DAAL03-86-K-0171 Partially supported by the National Science Foundation. NSF-ECS-8519058by Paul Tseng

Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation

Cover title.Includes bibliographical references (p. 33-38).Partially supported by the U.S. Army Research Office (Center for Intelligent Control Systems) DAAL03-86-K-0171 Partially supported by the National Science Foundation. NSF-ECS-8519058by Paul Tseng