Guaranteed Accuracy for Conic Programming Problems in Vector Lattices
From MaRDI portal
Publication:6206340
arXiv0707.4366MaRDI QIDQ6206340FDOQ6206340
Authors: Christian Jansson 
Publication date: 30 July 2007
Abstract: 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 completely rigorous because all rounding errors due to floating point arithmetic are taken into account. Numerical results, applications and software for linear and semidefinite programming problems are described.
This page was built for publication: Guaranteed Accuracy for Conic Programming Problems in Vector Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206340)
