Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57677637, #quickstatements; #temporary_batch_1707252663060 |
Removed claim: author (P16): Item:Q494874 |
||
| Property / author | |||
| Property / author: Tatiana V. Tchemisova / rank | |||
Revision as of 17:20, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implicit optimality criterion for convex SIP problem with box constrained index set |
scientific article |
Statements
Implicit optimality criterion for convex SIP problem with box constrained index set (English)
0 references
26 February 2013
0 references
semi-infinite programming (SIP)
0 references
semidefinite programming (SDP)
0 references
constraint qualifications (CQ)
0 references
immobile index
0 references
optimality conditions
0 references
