An analytic center quadratic cut method for the convex quadratic feasibility problem

DOI10.1007/s10107-002-0330-1zbMath1065.90061OpenAlexW1996513689MaRDI QIDQ1396218

Jean-Louis Goffin, Faranak Sharifi Mokhtarian

Publication date: 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0330-1

zbMATH Keywords

interior point methodsanalytic centerconvex quadratic inequality problemsquadratic cuts

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Interior-point methods (90C51) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

A second-order cone cutting surface method: Complexity and application ⋮ Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem

This page was built for publication: An analytic center quadratic cut method for the convex quadratic feasibility problem