A new primal-dual interior-point algorithm for semidefinite optimization
From MaRDI portal
Recommendations
- A new primal-dual interior-point algorithm for solving semidefinite optimization
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- An efficient parameterized logarithmic kernel function for semidefinite optimization
- Kernel function based interior-point algorithms for semidefinite optimization
Cited in
(19)- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Interior-point algorithm for semidefinite programming based on a logarithmic kernel function
- scientific article; zbMATH DE number 5734472 (Why is no real title available?)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- A relaxed logarithmic barrier method for semidefinite programming
- A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization
- A new second-order corrector interior-point algorithm for semidefinite programming
- scientific article; zbMATH DE number 7668279 (Why is no real title available?)
- A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
- A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
- Large-update primal-dual interior-point algorithm for semidefinite optimization
- scientific article; zbMATH DE number 5629815 (Why is no real title available?)
- A new primal-dual interior-point algorithm for solving semidefinite optimization
- scientific article; zbMATH DE number 741122 (Why is no real title available?)
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
- A scaled Gauss--Newton primal-dual search direction for semidefinite optimization
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
This page was built for publication: A new 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 Q3052572)
