Pages that link to "Item:Q4504787"

The following pages link to PCx: an interior-point code for linear programming (Q4504787):

Displaying 35 items.

• PCx (Q16889) (← links)
• Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
• CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
• Using the analytic center in the feasibility pump (Q408384) (← links)
• A variation on the interior point method for linear programming using the continued iteration (Q522093) (← 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)
• Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
• Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← 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)
• Interior point methods in DEA to determine non-zero multiplier weights (Q1762028) (← links)
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
• On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems (Q2067705) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming (Q2219452) (← links)
• Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method (Q2244972) (← links)
• A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• A finite termination Mehrotra-type predictor-corrector algorithm (Q2383922) (← links)
• Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
• A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming (Q2636608) (← 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)
• The other side of ranking schemes: generating weights for specified outcomes (Q2816367) (← links)
• Mehrotra-type predictor-corrector algorithm revisited (Q3539794) (← links)
• The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
• Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach (Q4685741) (← links)
• A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP (Q5039376) (← links)
• Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number (Q5058377) (← links)
• Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)
• A note on matrix reordering for linear system solutions by iterative methods in interior point methods (Q6606526) (← links)