Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming

DOI10.1137/S1052623498335067zbMath0990.90091OpenAlexW2080050276MaRDI QIDQ2706325

Kim-Chuan Toh

Publication date: 19 March 2001

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623498335067

zbMATH Keywords

semidefinite programminginterior point methodssearch directionsprimal-dual path-following methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items

A feasible primal-dual interior point method for linear semidefinite programming ⋮ Logarithmic barrier method via minorant function for linear semidefinite programming ⋮ Best ellipsoidal relaxation to solve a nonconvex problem. ⋮ Unnamed Item ⋮ On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 ⋮ A relaxed logarithmic barrier method for semidefinite programming ⋮ Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming

Uses Software

• SDPT3

This page was built for publication: Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming