Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems

DOI10.1002/nla.308zbMath1071.65512OpenAlexW2165375569MaRDI QIDQ5317906

Publication date: 21 September 2005

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.308

zbMATH Keywords

parallel computing interior-point methods preconditioned conjugate gradient method indefinite systems quadratic programs indefinite preconditioner

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Interior-point methods (90C51) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (30)

Unnamed Item ⋮ Interior-point solver for large-scale quadratic programming problems with bound constraints ⋮ Generalized block triangular preconditioner for symmetric saddle point problems ⋮ Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ Mixed constraint preconditioning in computational contact mechanics ⋮ Crash start of interior point methods ⋮ Two-Level Block Preconditioners for Contact Problems ⋮ Inner solvers for interior point methods for large scale nonlinear programming ⋮ Stopping criteria for inner iterations in inexact potential reduction methods: a computational study ⋮ Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods ⋮ On the update of constraint preconditioners for regularized KKT systems ⋮ A comparison of reduced and unreduced KKT systems arising from interior point methods ⋮ Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems ⋮ Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections ⋮ Spectral analysis of inexact constraint preconditioning for symmetric saddle point matrices ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Interior point methods 25 years later ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Some iterative methods for the solution of a symmetric indefinite KKT system ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods ⋮ Interior point methods for large-scale nonlinear programming ⋮ Mixed constraint preconditioners for the iterative solution of FE coupled consolidation equations ⋮ Conjugate gradient for nonsingular saddle-point systems with a maximally rank-deficient leading block ⋮ A matrix-free smoothing algorithm for large-scale support vector machines ⋮ Iterative solvers for 3D linear and nonlinear elasticity problems: Displacement and mixed formulations ⋮ Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines ⋮ Block triangular preconditioners for symmetric saddle-point problems ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization

Cites Work

Unnamed Item

This page was built for publication: Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems