Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6845435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming |
scientific article; zbMATH DE number 6845435 |
Statements
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (English)
0 references
28 February 2018
0 references
The authors consider conic linear programming (LP) problems. Contrary to standard linear programming, the Lagrange dual of a conic LP is in general not an exact dual. Here, the authors present exact duals and certificates of (weak) infeasibility for general conic LP. Moreover, they present some geometric statements, such as e.g. an exact characterization of when the linear image of a closed convex cone is closed.
0 references
conic linear programming
0 references
semidefinite programming
0 references
facial reduction
0 references
exact duals
0 references
exact certificates of infeasibility and weak infeasibility
0 references
closedness of the linear image of a closed convex cone
0 references
0 references
0 references
0 references
0.7839152812957764
0 references
0.783852756023407
0 references
0.7774823307991028
0 references
0.7678486704826355
0 references
0.7642819881439209
0 references
