Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques

DOI10.1007/S10957-023-02194-4zbMath1515.65150arXiv2205.01775OpenAlexW4362633406MaRDI QIDQ6167085

Jacek Gondzio, Stefano Cipolla

Publication date: 7 July 2023

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.01775

zbMATH Keywords

convex quadratic programminginterior point methodsproximal point methodsregularized primal-dual methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix-free interior point method
• Interior point methods 25 years later
• Convergence analysis of the inexact infeasible interior-point method for linear optimization
• Further development of multiple centrality correctors for interior point methods
• A primal-dual infeasible-interior-point algorithm for linear programming
• Error bounds in mathematical programming
• A primal-dual regularized interior-point method for convex quadratic programs
• Multiple centrality corrections in a primal-dual method for linear programming
• Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
• An interior point-proximal method of multipliers for convex quadratic programming
• On a primal-dual Newton proximal method for convex quadratic programs
• FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
• A comparison of reduced and unreduced KKT systems arising from interior point methods
• Multiplier and gradient methods
• Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Implicit Functions and Solution Mappings
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• On the Implementation of a Primal-Dual Interior Point Method
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
• A repository of convex quadratic programming problems
• Any Nonincreasing Convergence Curve is Possible for GMRES
• Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods

This page was built for publication: Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques