Pages that link to "Item:Q1361110"

The following pages link to A QMR-based interior-point algorithm for solving linear programs (Q1361110):

Displaying 12 items.

• Matrix-free interior point method (Q429480) (← links)
• A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
• A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
• Inexact interior-point method (Q1384053) (← links)
• Symbiosis between linear algebra and optimization (Q1591197) (← links)
• A modified SSOR-like preconditioner for non-Hermitian positive definite matrices (Q1995946) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
• On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
• Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618) (← links)
• Solving scalarized multi-objective network flow problems using an interior point method (Q3002548) (← links)