This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logar ...

By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...