Efficient Preconditioners for Interior Point Methods via a new Schur Complementation Strategy

04/27/2021
by   Samah Karim, et al.
0

We propose new preconditioned iterative solvers for linear systems arising in primal-dual interior point methods for convex quadratic programming problems. These preconditioned conjugate gradient methods operate on an implicit Schur complement of the KKT system at each iteration. In contrast to standard approaches, the Schur complement we consider enables the reuse of the factorization of the Hessian of the equality-constraint Lagrangian across all interior point iterations. Further, the resulting reduced system admits preconditioners that directly alleviate the ill-conditioning associated with the strict complementarity condition in interior point methods. The two preconditioners we propose also provably reduce the number of unique eigenvalues for the coefficient matrix (CG iteration count). One is efficient when the number of equality constraints is small, while the other is efficient when the number of remaining degrees of freedom is small. Numerical experiments with synthetic problems and problems from the Maros-Mészáros QP collection show that our preconditioned inexact interior point solvers are effective at improving conditioning and reducing cost. Across all test problems for which the direct method is not fastest, our preconditioned methods achieve a reduction in cost by a geometric mean of 1.432 relative to the best alternative preconditioned method for each problem.

READ FULL TEXT

page 23

page 25

research
12/20/2019

A New Preconditioning Approach for an Interior Point-Proximal Method of Multipliers for Linear and Convex Quadratic Programming

In this paper, we address the efficient numerical solution of linear and...
research
08/01/2023

Krylov Solvers for Interior Point Methods with Applications in Radiation Therapy

Interior point methods are widely used for different types of mathematic...
research
08/04/2022

Transformed Primal-Dual Methods For Nonlinear Saddle Point Systems

A transformed primal-dual (TPD) flow is developed for a class of nonline...
research
01/26/2021

Large-scale Optimization with Linear Equality Constraints using Reduced Compact Representation

For optimization problems with sparse linear equality constraints, we ob...
research
03/03/2023

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems

An arc-search interior-point method is a type of interior-point methods ...
research
08/18/2021

Schur complement based preconditioners for twofold and block tridiagonal saddle point problems

In this paper, two types of Schur complement based preconditioners are s...
research
06/25/2021

𝒩IPM-HLSP: An Efficient Interior-Point Method for Hierarchical Least-Squares Programs

Hierarchical least-squares programs with linear constraints (HLSP) are a...

Please sign up or login with your details

Forgot password? Click here to reset