Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
From MaRDI portal
(Redirected from Publication:5317906)
Recommendations
- scientific article; zbMATH DE number 1406968
- On the solution of indefinite systems arising in nonlinear programming problems
- Preconditioning indefinite systems in interior point methods for optimization
- Preconditioners for Indefinite Systems Arising in Optimization
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
Cited in
(37)- Block triangular preconditioners for symmetric saddle-point problems
- Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems
- Spectral analysis of inexact constraint preconditioning for symmetric saddle point matrices
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Conjugate gradient for nonsingular saddle-point systems with a maximally rank-deficient leading block
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- A matrix-free smoothing algorithm for large-scale support vector machines
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- On mutual impact of numerical linear algebra and large-scale optimization with focus on 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
- 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
- Mixed constraint preconditioning in computational contact mechanics
- 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
- Two-level block preconditioners for contact problems
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- Iterative solvers for 3D linear and nonlinear elasticity problems: displacement and mixed formulations
- Crash start of interior point methods
- On the solution of indefinite systems arising in nonlinear programming problems
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- Preconditioners for Indefinite Systems Arising in Optimization
- Interior point methods 25 years later
- BFGS-like updates of constraint preconditioners for sequences of KKT linear systems in quadratic programming.
- scientific article; zbMATH DE number 1406968 (Why is no real title available?)
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- scientific article; zbMATH DE number 5233132 (Why is no real title available?)
- Interior point methods for large-scale nonlinear programming
- Preconditioners for Krylov subspace methods: An overview
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- Randomized Nyström preconditioned interior point-proximal method of multipliers
- Interior point methods in the year 2025
- Generalized block triangular preconditioner for symmetric saddle point problems
- Mixed constraint preconditioners for the iterative solution of FE coupled consolidation equations
This page was built for publication: Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317906)
