Condition Number Complexity of an Elementary Algorithm for Resolving a Conic Linear System (1997)
by
Marina Epelman
,
Robert M. Freund
| Citations: | 11 - 4 self |
BibTeX
@MISC{Epelman97conditionnumber,
author = {Marina Epelman and Robert M. Freund},
title = {Condition Number Complexity of an Elementary Algorithm for Resolving a Conic Linear System},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We develop an algorithm for resolving a conic linear system (FP d ), which is a system of the form (FP d ): b Ax 2 C Y x 2 CX ; where CX and C Y are closed convex cones, and the data for the system is d = (A; b).
