Pages that link to "Item:Q1765884"

The following pages link to A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884):

Displaying 50 items.

• Crash start of interior point methods (Q323526) (← links)
• Matrix-free interior point method (Q429480) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• Sparsity preserving preconditioners for linear systems in interior-point methods (Q493682) (← links)
• A new method for multiple attribute group decision-making with intuitionistic trapezoid fuzzy linguistic information (Q521697) (← 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)
• Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← 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)
• Finding the orthogonal projection of a point onto an affine subspace (Q874996) (← links)
• Convergence analysis of the inexact infeasible interior-point method for linear optimization (Q1028608) (← links)
• The preconditioned variational methods for solving large linear systems (Q1070764) (← links)
• Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← 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 primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
• Preconditioning indefinite systems in interior point methods for optimization (Q1876589) (← links)
• Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics (Q2006121) (← links)
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
• A new proposal to improve the early iterations in the interior point method (Q2178307) (← links)
• Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming (Q2219452) (← links)
• Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
• New preconditioners applied to linear programming and the compressive sensing problems (Q2226494) (← links)
• Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method (Q2244972) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
• A primal-dual interior-point algorithm for quadratic programming (Q2502230) (← links)
• A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming (Q2636608) (← links)
• Inner solvers for interior point methods for large scale nonlinear programming (Q2642630) (← links)
• An interior-point approach for primal block-angular problems (Q2643610) (← links)
• Inexact constraint preconditioners for linear systems arising in interior point methods (Q2643611) (← links)
• Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618) (← links)
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
• Interior-point solver for convex separable block-angular problems (Q2811483) (← links)
• Preconditioning indefinite systems in interior point methods for large scale linear optimisation (Q3514841) (← links)
• A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods (Q3562405) (← links)
• Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
• Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach (Q4685741) (← 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)
• On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems (Q5348470) (← links)
• A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods (Q6039242) (← links)
• General-purpose preconditioning for regularized interior point methods (Q6043128) (← links)
• A New Approach to the Splitting Factor Preconditioner Applied to Linear Programming Problems (Q6088058) (← links)
• Preconditioners for Krylov subspace methods: An overview (Q6144043) (← links)
• Recycling basic columns of the splitting preconditioner in interior point methods (Q6166647) (← links)