Pages that link to "Item:Q2643618"

The following pages link to Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618):

Displaying 28 items.

• Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• Sparsity preserving preconditioners for linear systems in interior-point methods (Q493682) (← links)
• Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming (Q522098) (← links)
• Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (Q665950) (← links)
• A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
• Convergence analysis of the inexact infeasible interior-point method for linear optimization (Q1028608) (← links)
• Prior reduced fill-in in solving equations in interior point algorithms (Q1197902) (← links)
• Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
• A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
• Improving the preconditioning of linear systems from interior point methods (Q1652361) (← links)
• Using groups in the splitting preconditioner computation for interior point methods (Q1728413) (← links)
• A specialized primal-dual interior point method for the plastic truss layout optimization (Q1756573) (← links)
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
• Preconditioning indefinite systems in interior point methods for optimization (Q1876589) (← links)
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
• Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
• Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming (Q2219452) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming (Q2636608) (← links)
• Inexact constraint preconditioners for linear systems arising in interior point methods (Q2643611) (← links)
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
• Preconditioning indefinite systems in interior point methods for large scale linear optimisation (Q3514841) (← links)
• An inexact interior-point method for system analysis (Q3578795) (← links)
• Linear programming with a feasible direction interior point technique for smooth optimization (Q5053902) (← links)
• Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy (Q5057773) (← links)
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming (Q5124003) (← links)
• Preconditioners for Krylov subspace methods: An overview (Q6144043) (← links)