Cutting plane algorithms for nonlinear semi-definite programming problems with applications
From MaRDI portal
Publication:1411319
DOI10.1023/A:1021985014197zbMath1030.90078MaRDI QIDQ1411319
Hoang Tuy, Hiroshi Konno, Naoya Kawadai
Publication date: 27 October 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Semi-infinite programming; Semi-definite programming; Outer-approximation; Cutting plane algorithm; Ellipsoidal separation; Low rank nonconvex problem; Quadratic regression; Semi-definite logit model
90C22: Semidefinite programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C34: Semi-infinite programming
Related Items
Solving a large scale semi-definite logit model, A two step algorithm for solving a large scale semi-definite logit model, A sixth bibliography of fractional programming