Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure (Q4202585): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/informs/CarpenterLMS93, #quickstatements; #temporary_batch_1731543907597 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.5.2.182 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079687415 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/informs/CarpenterLMS93 / rank | |||
Normal rank | |||
Latest revision as of 01:56, 14 November 2024
scientific article; zbMATH DE number 404915
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure |
scientific article; zbMATH DE number 404915 |
Statements
Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure (English)
0 references
12 October 1993
0 references
primal-dual interior point procedure
0 references
convex separable quadratic objectives
0 references
linearly constrained convex separable nonlinear programs
0 references
