Dual interior point methods for linear semidefinite programming problems
From MaRDI portal
Recommendations
- A primal interior point method for the linear semidefinite programming problem
- An admissible dual internal point method for a linear semidefinite programming problem
- On convergence of the dual Newton method for a linear semidefinite programming problem
- A variant of the dual simplex method for a linear semidefinite programming problem
- A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem
Cited in
(11)- Symmetric primal-dual path-following algorithms for semidefinite programming
- A primal-dual interior point method for parametric semidefinite programming problems
- A variant of the dual simplex method for a linear semidefinite programming problem
- An admissible dual internal point method for a linear semidefinite programming problem
- A novel approach for solving semidefinite programs
- A primal interior point method for the linear semidefinite programming problem
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- On convergence of the dual Newton method for a linear semidefinite programming problem
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- scientific article; zbMATH DE number 895357 (Why is no real title available?)
- A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem
This page was built for publication: Dual interior point methods for linear semidefinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901126)