Large-update primal-dual interior-point algorithm for semidefinite optimization
From MaRDI portal
Recommendations
- Kernel function based interior-point algorithms for semidefinite optimization
- Interior-point algorithm for SDO based on new classes of kernel functions
- A new primal-dual interior-point algorithm for solving semidefinite optimization
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
- A new primal-dual interior-point algorithm for semidefinite optimization
Cited in
(11)- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- An efficient parameterized logarithmic kernel function for semidefinite optimization
- Large-update interior point algorithm for P_*-linear complementarity problem
- Interior-point algorithm for SDO based on new classes of kernel functions
- First-order methods in large-scale semidefinite optimization.
- A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A new primal-dual interior-point algorithm for solving semidefinite optimization
- scientific article; zbMATH DE number 7668279 (Why is no real title available?)
- A New full-newton step infeasible interior-point method for P_*(\kappa )-linear Complementarity problem
This page was built for publication: Large-update primal-dual interior-point algorithm for semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501731)
