Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (Q1681319)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation |
scientific article; zbMATH DE number 6811915
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation |
scientific article; zbMATH DE number 6811915 |
Statements
Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (English)
0 references
23 November 2017
0 references
convex programming
0 references
nonconvex constraints
0 references
constraint qualifications
0 references
best approximation
0 references
necessary and sufficient optimality conditions
0 references
0 references
0 references
0 references
0 references
