Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
10.1023/B:COAP.0000013059.84424.af
Saved in:
Main Authors: | Zhou, G., Toh, K.-C., Zhao, G. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103065 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
by: Dai, Y.-H., et al.
Published: (2021) -
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
by: Zhou, G., et al.
Published: (2014) -
Efficient detection and exploitation of infeasible paths for software timing analysis
by: Suhendra, V., et al.
Published: (2013) -
A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods
by: Liu, X., et al.
Published: (2013) -
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
by: Li, L., et al.
Published: (2014)