Abstract
A feasible interior-point method (IPM) for the Cartesian P(kappa)-linear complementarity problem over symmetric cones (SCLCP) is presented. The method uses Nesterov-Todd (NT) search directions and full step updates of iterates. With appropriate choice of parameters the algorithm generates a sequence of iterates in the small neighborhood of the central path which implies global convergence of the method and local quadratic convergence of iterates. The iteration complexity of the method matches the currently best known iteration bound for IPMs solving P(kappa)-SCLCP.
| Original language | American English |
|---|---|
| State | Published - Jul 1 2013 |
| Event | European Conference on Operational Research Joint Conference (EURO-INFORMS) - Rome, Italy Duration: Jul 1 2013 → … |
Conference
| Conference | European Conference on Operational Research Joint Conference (EURO-INFORMS) |
|---|---|
| Period | 07/1/13 → … |
Disciplines
- Applied Mathematics
- Mathematics
Keywords
- Feasible
- Full NT-step
- Interior-point methods
- SCLCP