Logarithmic barrier method via minorant function for linear semidefinite programming
From MaRDI portal
Recommendations
Cites work
- A feasible primal-dual interior point method for linear semidefinite programming
- A logarithm barrier method for semi-definite programming
- A numerical feasible interior point method for linear semidefinite programs
- A relaxed logarithmic barrier method for semidefinite programming
- Bounds for eigenvalues using traces
- Convex Analysis
- New bounds for the extreme values of a finite sample of real numbers
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Some new search directions for primal-dual interior point methods in semidefinite programming
Cited in
(5)- A relaxed logarithmic barrier method for semidefinite programming
- Adaptation of the minorant function for linear programming
- A logarithm barrier method for semi-definite programming
- A logarithmic barrier approach for linear programming
- A novel adaptive method based on new minorant-majorant functions without line search for semidefinite optimization
This page was built for publication: Logarithmic barrier method via minorant function for linear semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693233)