Extension of smoothing Newton algorithms to solve linear programming over symmetric cones.
Zheng-Hai HuangXiaohong LiuPublished in: J. Syst. Sci. Complex. (2011)
Keyphrases
- linear programming
- interior point
- learning algorithm
- data structure
- times faster
- linear program
- worst case
- data mining
- orders of magnitude
- np hard
- significant improvement
- computational complexity
- optimization problems
- dynamic programming
- computationally efficient
- convex optimization
- semidefinite programming
- interior point methods
- neural network
- simplex algorithm