A new barrier for a class of semidefinite problems
From MaRDI portal
Recommendations
- On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
- scientific article; zbMATH DE number 1091399
- Penalty and barrier methods for convex semidefinite programming
- A logarithm barrier method for semi-definite programming
- A relaxed logarithmic barrier method for semidefinite programming
- Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
- The volumetric barrier for semidefinite programming.
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- A novel approach for solving semidefinite programs
- Some New Results for the Semidefinite Linear Complementarity Problem
Cites work
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Lower Bounds for the Partitioning of Graphs
- New self-concordant barrier for the hypercube
- On the Convergence of the Central Path in Semidefinite Optimization
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
Cited in
(3)
This page was built for publication: A new barrier for a class of semidefinite problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635704)