The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Guaranteed Accuracy for Conic Programming Problems in Vector Lattices
[article]
2007
arXiv
pre-print
This paper presents rigorous forward error bounds for linear conic optimization problems. The error bounds are formulated in a quite general framework; the underlying vector spaces are not required to be finite-dimensional, and the convex cones defining the partial ordering are not required to be polyhedral. In the case of linear programming, second order cone programming, and semidefinite programming specialized formulas are deduced yielding guaranteed accuracy. All computed bounds are
arXiv:0707.4366v1
fatcat:wdcd5f2bvne47khgvntofwwvi4