Pages that link to "Item:Q4917131"

The following pages link to A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems (Q4917131):

Displaying 15 items.

• Jacobian-free implicit inner-iteration preconditioner for nonlinear least squares problems (Q333209) (← links)
• A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
• On preconditioner updates for sequences of saddle-point linear systems (Q1642732) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
• On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices (Q2305868) (← links)
• An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
• Effective matrix-free preconditioning for the augmented immersed interface method (Q2374867) (← links)
• A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization (Q2397822) (← links)
• Preconditioned nonlinear conjugate gradient methods based on a modified secant equation (Q2422866) (← links)
• Interior-point solver for convex separable block-angular problems (Q2811483) (← links)
• GMRES-Accelerated ADMM for Quadratic Objectives (Q4554067) (← links)
• A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization (Q5116544) (← links)
• On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems (Q5348470) (← links)
• Preconditioners for Krylov subspace methods: An overview (Q6144043) (← links)