An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
From MaRDI portal
Recommendations
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- On the complexity of semidefinite programs
Cited in
(15)- An extension of Chubanov's algorithm to symmetric cones
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- A unifying framework for several cutting plane methods for semidefinite programming
- scientific article; zbMATH DE number 1182565 (Why is no real title available?)
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Learning lyapunov functions for hybrid systems
- Finding a strict feasible solution of a linear semidefinite program
- A second-order cone cutting surface method: Complexity and application
- A matrix generation approach for eigenvalue optimization
This page was built for publication: An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704080)
