On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
Computational Optimization and Applications
Saved in:
Main Authors: | Zhao, G., Sun, J. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/45068 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
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) -
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
by: Li, L., et al.
Published: (2014) -
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
by: Sim, C.-K., et al.
Published: (2014) -
A quadratically convergent polynomial long-step algorithm for a class of nonlinear monotone complementarity problems
by: Sun, J., et al.
Published: (2013)