Method of approximate centers for semi-definite programming
From MaRDI portal
Publication:4345241
Recommendations
- scientific article; zbMATH DE number 1247169
- Publication:5752300
- A polynomial method of approximate centers for linear programming
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- Algorithms in the method of centers with approximation of the set of admissible solutions
- Method of centers for generalized fractional programming
- On weighted centers for semidefinite programming
- scientific article; zbMATH DE number 2016598
- scientific article; zbMATH DE number 45207
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
Cites work
- A polynomial method of approximate centers for linear programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On a Matrix Generalization of Affine-Scaling Vector Fields
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Semidefinite Programming
Cited in
(5)- A long-step primal-dual path-following method for semidefinite programming
- Circumcentering the Douglas-Rachford method
- Embedding methods for semidefinite programming
- On weighted centers for semidefinite programming
- Algorithms with combination, parametrization, and two-sided approximation in the center method.
This page was built for publication: Method of approximate centers for semi-definite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345241)
