Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
Publication:4202585
DOI10.1287/IJOC.5.2.182zbMath0777.90038DBLPjournals/informs/CarpenterLMS93OpenAlexW2079687415WikidataQ60140239 ScholiaQ60140239MaRDI QIDQ4202585
David F. Shanno, Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey
Publication date: 12 October 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.5.2.182
convex separable quadratic objectiveslinearly constrained convex separable nonlinear programsprimal-dual interior point procedure
Convex programming (90C25) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
This page was built for publication: Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure