Strong duality for standard convex programs (Q2074838)
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 7472338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong duality for standard convex programs |
scientific article; zbMATH DE number 7472338 |
Statements
Strong duality for standard convex programs (English)
0 references
11 February 2022
0 references
The paper studies strong duality without constraint qualifications for standard convex optimization problems using bifunctions, image space analysis, and polynomial ring approaches. New (so-called strong) dual problems are assigned to primal convex optimization problems and an example illustrates the proposed theoretical achievements.
0 references
convex optimization
0 references
strong duality
0 references
bifunction
0 references
image space analysis
0 references
polynomial ring
0 references
0 references
0 references
0.8750982880592346
0 references
0.8566362261772156
0 references
0.8503546118736267
0 references
0.831599771976471
0 references
