New answers tagged

0 votes

Complexity of the ellipsoid method in general convex problems

The following links refers to application of ellipsoidal algorithms with some variations to NLPs: Paper by Drs. Rugenstein. E & Kupferschimd.M: presents results showing convergence by ellipsoidal ...
Sutanu Majumdar's user avatar
0 votes

interior point computational complexity for SDP

Throughout, I will use $\texttt{n}$ to refer to the "n" in your code, $n$ to refer to the size of the semidefinite matrix variable (what the literature calls $n$), and $m$ to be the number ...
NaturalLogZ's user avatar

Top 50 recent answers are included