OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

K.O. Kortanek

doi:10.1080/02331930290019459

Back

OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

Journal article

Peer reviewed

OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS

K.O. Kortanek

Optimization, Vol.51(2), pp.323-338

04/01/2002

DOI: 10.1080/02331930290019459

View Online

Abstract

New insights are presented from a convex duality classification theory of over 25 years ago for recent computational complexity results developed for recognizing some of the asymptotic duality states that prevail for an arbitrary convex programming pair.

Consistency

Convex programming

Homogeneous programs

Inconsistency

Non-polyhedral convex cones

Semidefinite programs

ϵ-infeasibility

Details

Title: Subtitle: OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
Creators: K.O. Kortanek - University of Iowa
Resource Type: Journal article
Publication Details: Optimization, Vol.51(2), pp.323-338
DOI: 10.1080/02331930290019459
ISSN: 0233-1934
eISSN: 1029-4945
Publisher: Taylor & Francis Group
Number of pages: 16
Language: English
Date published: 04/01/2002
Academic Unit: Business Analytics
Record Identifier: 9984963214002771

Metrics

1 Record Views