Cutting plane algorithms for nonlinear semi-definite programming problems with applications

DOI10.1023/A:1021985014197zbMath1030.90078MaRDI QIDQ1411319

Naoya Kawadai, Hoang Tuy, Hiroshi Konno

Publication date: 27 October 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

Semi-infinite programmingSemi-definite programmingOuter-approximationCutting plane algorithmEllipsoidal separationLow rank nonconvex problemQuadratic regressionSemi-definite logit model

Mathematics Subject Classification ID

Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Semi-infinite programming (90C34)

Related Items (8)

Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems ⋮ Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation ⋮ Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts ⋮ A two step algorithm for solving a large scale semi-definite logit model ⋮ Solving a large scale semi-definite logit model ⋮ A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems ⋮ A sixth bibliography of fractional programming

This page was built for publication: Cutting plane algorithms for nonlinear semi-definite programming problems with applications