Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128894739, #quickstatements; #temporary_batch_1723898920960 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128894739 / rank | |||
Normal rank | |||
Revision as of 14:05, 17 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra |
scientific article |
Statements
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (English)
0 references
19 December 2019
0 references
simplex method
0 references
conic quadratic optimization
0 references
quadratic programming
0 references
warm starts
0 references
value-at-risk minimization
0 references
portfolio optimization
0 references
robust optimization
0 references
0 references
0 references
0 references
0 references
0 references
