Pages that link to "Item:Q5057773"
From MaRDI portal
The following pages link to Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy (Q5057773):
Displaying 13 items.
- Clustering-based preconditioning for stochastic programs (Q288399) (← links)
- On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints (Q730628) (← links)
- Using groups in the splitting preconditioner computation for interior point methods (Q1728413) (← links)
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
- A comparison of reduced and unreduced KKT systems arising from interior point methods (Q2401021) (← links)
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method (Q3112404) (← links)
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (Q3603659) (← links)
- BFGS‐like updates of constraint preconditioners for sequences of KKT linear systems in quadratic programming (Q4558699) (← links)
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number (Q5058377) (← links)
- Schwarz Solvers and Preconditioners for the Closest Point Method (Q5146688) (← links)
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems (Q5317906) (← links)
- Recycling basic columns of the splitting preconditioner in interior point methods (Q6166647) (← links)
- Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques (Q6167085) (← links)
