Mathematical Sciences: Faculty Presentations (1991-2022)

Full NT-Step Feasible Interior-Point Methods for P*(κ)-Linear Complementarity Problems over Symmetric Cones

Document Type

Presentation

Presentation Date

7-1-2013

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Abstract or Description

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.

Sponsorship/Conference/Institution

European Conference on Operational Research Joint Conference (EURO-INFORMS)

Location

Rome, Italy

Link to Full Text

Share

COinS