Add to ORKGCaption title.Includes bibliographical references (p. 11).Supported by ARPA. 9300494-DMIby Dimitri P. Bertsekas
AbstractWe introduce two interior point algorithms for minimizing a convex function subject to linea...
This note derives bounds on the length of the primal-dual affine scaling directions associated with ...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
Title from caption. "March, 1998"--Cover. "June 1997. -- Modified in February 1998 (formerly LIDS-P-...
A global error bound is given on the distance between an arbitrary point in the n-dimensional real s...
A global error bound is given on the distance between an arbitrary point in the n-dimensional real s...
AbstractWe use the penalty function method to study duality in generalized convex (invex) programmin...
AbstractComputable lower and upper bounds on the optimal and dual optimal solutions of a nonlinear, ...
We consider convex constrained optimization problems, and we enhance the classical Fritz John optima...
Cover title.Includes bibliographical references.Supported by the National Science Foundation. NSF-EC...
In this paper, we provide an elementary, geometric, and unified framework to analyze conic programs ...
It has been shown by Fiacco that convexity or concavity of the optimal value of a parametric nonline...
This article addresses a general criterion providing a zero duality gap for convex programs in the s...
AbstractIn this paper we develop bounds for the displacement in the solution set of a system of pert...
Bibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
AbstractWe introduce two interior point algorithms for minimizing a convex function subject to linea...
This note derives bounds on the length of the primal-dual affine scaling directions associated with ...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...
Title from caption. "March, 1998"--Cover. "June 1997. -- Modified in February 1998 (formerly LIDS-P-...
A global error bound is given on the distance between an arbitrary point in the n-dimensional real s...
A global error bound is given on the distance between an arbitrary point in the n-dimensional real s...
AbstractWe use the penalty function method to study duality in generalized convex (invex) programmin...
AbstractComputable lower and upper bounds on the optimal and dual optimal solutions of a nonlinear, ...
We consider convex constrained optimization problems, and we enhance the classical Fritz John optima...
Cover title.Includes bibliographical references.Supported by the National Science Foundation. NSF-EC...
In this paper, we provide an elementary, geometric, and unified framework to analyze conic programs ...
It has been shown by Fiacco that convexity or concavity of the optimal value of a parametric nonline...
This article addresses a general criterion providing a zero duality gap for convex programs in the s...
AbstractIn this paper we develop bounds for the displacement in the solution set of a system of pert...
Bibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
AbstractWe introduce two interior point algorithms for minimizing a convex function subject to linea...
This note derives bounds on the length of the primal-dual affine scaling directions associated with ...
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject t...