Add to ORKGBibliography: p. 25-26.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Bertsekas
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
In this paper, we study a nonconvex quadratic minimization problem with two quadratic constraints, o...
Cover title.Includes bibliographical references.Supported by the National Science Foundation. NSF-EC...
Bibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
In this paper we consider the problem of minimizing a strictly convex, possibly nondifferentiable co...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
Caption title. "July 1988."Includes bibliographical references.Work supported by the National Scienc...
We study a generic minimization problem with separable non-convex piecewise linear costs, showing th...
134 pagesNonconvex optimizations are ubiquitous in many application fields. One important aspect of ...
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical con...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
In this paper, we study a nonconvex quadratic minimization problem with two quadratic constraints, o...
Cover title.Includes bibliographical references.Supported by the National Science Foundation. NSF-EC...
Bibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
In this paper we consider the problem of minimizing a strictly convex, possibly nondifferentiable co...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office...
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentia...
Caption title. "July 1988."Includes bibliographical references.Work supported by the National Scienc...
We study a generic minimization problem with separable non-convex piecewise linear costs, showing th...
134 pagesNonconvex optimizations are ubiquitous in many application fields. One important aspect of ...
We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical con...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
In this paper, we study a nonconvex quadratic minimization problem with two quadratic constraints, o...