Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (Q1681319): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2017.07.038 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2017.07.038 / rank | |||
Normal rank | |||
Latest revision as of 03:02, 11 December 2024
scientific article
| 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 |
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
