Add to ORKGBibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Supported in part by the Army Research Office. DAAL03-86-K-0171 Supported in part by Canadian NSERC. U0505by Paul Tseng, Dimitri P. Bertsekas
134 pagesNonconvex optimizations are ubiquitous in many application fields. One important aspect of ...
Title from cover.Bibliography: leaf [20].National Science Foundation Grant NSF-ECS-8217668.by Paul T...
Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office...
Bibliography: p. 44-45.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Be...
Bibliography: p. 25-26.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Be...
Cover title.Includes bibliographical references.Supported by the National Science Foundation. NSF-EC...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
In this paper we consider the problem of minimizing a strictly convex, possibly nondifferentiable co...
Bibliography: p. 38-39.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
Cover title. "This paper is based in part on the technical report [17]."Includes bibliographical ref...
This paper presents a new primal-dual algorithm for solving a class of monotropic programming proble...
Caption title. "July 1988."Includes bibliographical references.Work supported by the National Scienc...
134 pagesNonconvex optimizations are ubiquitous in many application fields. One important aspect of ...
Title from cover.Bibliography: leaf [20].National Science Foundation Grant NSF-ECS-8217668.by Paul T...
Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office...
Bibliography: p. 44-45.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Be...
Bibliography: p. 25-26.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Be...
Cover title.Includes bibliographical references.Supported by the National Science Foundation. NSF-EC...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
In this paper we consider the problem of minimizing a strictly convex, possibly nondifferentiable co...
Bibliography: p. 38-39.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
Cover title. "This paper is based in part on the technical report [17]."Includes bibliographical ref...
This paper presents a new primal-dual algorithm for solving a class of monotropic programming proble...
Caption title. "July 1988."Includes bibliographical references.Work supported by the National Scienc...
134 pagesNonconvex optimizations are ubiquitous in many application fields. One important aspect of ...
Title from cover.Bibliography: leaf [20].National Science Foundation Grant NSF-ECS-8217668.by Paul T...
Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office...