Showing 1 - 1 of 1
The purpose of this paper is to extend, as much as possible, the modern theory of condition numbers for conic convex optimization: z_* = min cx subject to Ax-b \in C_Y , x \in C_X, to the more general non-conic format: (GP_d) z_* = min cx subject to Ax-b \in C_Y , x \in P, where P is any closed...
Persistent link: https://www.econbiz.de/10005574502