An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
From MaRDI portal
Publication:5704080
DOI10.1287/moor.27.2.332.327zbMath1082.90555OpenAlexW2118295943MaRDI QIDQ5704080
Gongyun Zhao, Kim-Chuan Toh, Jie Sun
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/08b297dd7d0ea023f3cc5f9bfa918dfb92afda5b
Related Items (10)
A second-order cone cutting surface method: Complexity and application ⋮ A matrix generation approach for eigenvalue optimization ⋮ Learning lyapunov functions for hybrid systems ⋮ Finding a strict feasible solution of a linear semidefinite program ⋮ An extension of Chubanov's algorithm to symmetric cones ⋮ Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ A unifying framework for several cutting plane methods for semidefinite programming ⋮ An alternating direction method for solving convex nonlinear semidefinite programming problems
This page was built for publication: An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
