Conditions for zero duality gap in convex programming (Q5410417): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q428497 |
Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
label / en | label / en | ||
Conditions for zero duality gap in convex programming | |||
Property / author | |||
Property / author: Regina Sandra Burachik / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv classification | |||
math.FA | |||
Property / arXiv classification: math.FA / rank | |||
Normal rank | |||
Property / arXiv classification | |||
math.OC | |||
Property / arXiv classification: math.OC / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1211.4953 / rank | |||
Normal rank |
Latest revision as of 03:05, 20 April 2024
scientific article; zbMATH DE number 6285814
Language | Label | Description | Also known as |
---|---|---|---|
English | Conditions for zero duality gap in convex programming |
scientific article; zbMATH DE number 6285814 |
Statements
16 April 2014
0 references
zero duality gap
0 references
convex programming
0 references
Bertsekas constraint qualification
0 references
Fenchel conjugate
0 references
Fenchel duality theorem
0 references
normal cone operator
0 references
\(\inf\)-convolution
0 references
\(\varepsilon\)-subdifferential
0 references
math.FA
0 references
math.OC
0 references