A characterization of ill-posed data instances for convex programming |
| |
| Authors: | Manuel A Nunez |
| |
| Institution: | (1) Department of Operations and Information Management, University of Connecticut, 368 Fairfield Road, U-411M, Storrs, CT 06066, USA, e-mail: mnunez@sba.uconn.edu, US |
| |
| Abstract: | Given a data instance of a convex program, we provide a collection of conic linear systems such that the data instance is
ill-posed if and only if at least one of those systems is satisfied. This collection of conic linear systems is derived from
a characterization of the boundary of the set of primal and dual feasible data instances associated with the given convex
program.
Received: September 1998 / Accepted: August 2000?Published online October 26, 2001 |
| |
| Keywords: | : convex programming – perturbation of convex programs – linear conic systems – theorems of the alternative – ill-posed problems – condition numbers |
| 本文献已被 SpringerLink 等数据库收录！ |
|
