Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques
From MaRDI portal
Publication:6167085
Abstract: In this work, in the context of Linear and Quadratic Programming, we interpret Primal Dual Regularized Interior Point Methods (PDR-IPMs) in the framework of the Proximal Point Method. The resulting Proximal Stabilized IPM (PS-IPM) is strongly supported by theoretical results concerning convergence and the rate of convergence, and can handle degenerate problems. Moreover, in the second part of this work, we analyse the interactions between the regularization parameters and the computational foot-print of the linear algebra routines used to solve the Newton linear systems. In particular, when these systems are solved using an iterative Krylov method, we propose general purpose preconditioners which, exploiting the regularization and a new rearrangement of the Schur complement, remain attractive for a series of subsequent IPM iterations. Therefore they need to be recomputed only in a fraction of the total IPM iterations. The resulting regularized second order methods, for which low-frequency-updates of the preconditioners are allowed, pave the path for an alternative third way in-between first and second order methods.
Recommendations
- General-purpose preconditioning for regularized interior point methods
- Improving the preconditioning of linear systems from interior point methods
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
- Preconditioned proximal point methods and notions of partial subregularity
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- Interior dual proximal point algorithm using preconditioned conjugate gradient †
- Interior‐point methods and preconditioning for PDE‐constrained optimization problems involving sparsity terms
- Stabilization of interior-point methods for linear programming
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- Sparsity preserving preconditioners for linear systems in interior-point methods
Cites work
- A comparison of reduced and unreduced KKT systems arising from interior point methods
- A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods
- A primal-dual infeasible-interior-point algorithm for linear programming
- A primal-dual regularized interior-point method for convex quadratic programs
- A repository of convex quadratic programming problems
- An interior point-proximal method of multipliers for convex quadratic programming
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Error bounds in mathematical programming
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Further development of multiple centrality correctors for interior point methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 3376275 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Interior point methods 25 years later
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Matrix-free interior point method
- Monotone Operators and the Proximal Point Algorithm
- Multiple centrality corrections in a primal-dual method for linear programming
- Multiplier and gradient methods
- On a primal-dual Newton proximal method for convex quadratic programs
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On the Implementation of a Primal-Dual Interior Point Method
- Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
Cited in
(10)- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- BFGS-like updates of constraint preconditioners for sequences of KKT linear systems in quadratic programming.
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- Interior point methods in the year 2025
- Nested branch-and-price for multi-mode nanosatellite task scheduling with interior-point regularization and GPU acceleration
- Enforcing Katz and PageRank centrality measures in complex networks
- Proximal-stabilized semidefinite programming
- A regularized interior point method for sparse optimal transport on graphs
- The -condition number: applications to preconditioning and low rank generalized Jacobian updating
- An inexact interior-point relaxation method for linear optimization with a spectral preconditioner
This page was built for publication: Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167085)
