A decomposition method for quadratic programming (Q4323676): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1147/sj.311.0039 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1147/sj.311.0039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095076300 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1147/SJ.311.0039 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:44, 29 December 2024
scientific article; zbMATH DE number 724698
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition method for quadratic programming |
scientific article; zbMATH DE number 724698 |
Statements
A decomposition method for quadratic programming (English)
0 references
12 June 1995
0 references
optimization subroutine library
0 references
convex quadratic programming
0 references
simplex algorithm
0 references
