Login / Signup
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm.
Robert M. Freund
Jorge R. Vera
Published in:
SIAM J. Optim. (1999)
Keyphrases
</>
convex optimization
computational complexity
worst case
dynamic programming
learning algorithm
interior point methods
optimal solution
cost function
linear programming
objective function
np hard
primal dual
linear systems
convex formulation