The curvature integral and the complexity of linear complementarity problems
10.1007/BF01585931
Saved in:
Main Authors: | Zhao, G., Zhu, J. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/104276 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A quadratically convergent polynomial long-step algorithm for a class of nonlinear monotone complementarity problems
by: Sun, J., et al.
Published: (2013) -
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
by: Zhou, G., et al.
Published: (2014) -
Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path
by: Zhao, G.
Published: (2014) -
On the relationship between the curvature integral and the complexity of path-following methods in linear programming
by: Zhao, G.
Published: (2014) -
On the Nesterov-Todd direction in semidefinite programming
by: Todd, M.J., et al.
Published: (2014)