Pages that link to "Item:Q4025908"

The following pages link to Further Development of a Primal-Dual Interior Point Method (Q4025908):

Displaying 29 items.

• A variation on the interior point method for linear programming using the continued iteration (Q522093) (← links)
• Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
• Splitting dense columns in sparse linear systems (Q803727) (← links)
• Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
• Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
• A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
• On finding a vertex solution using interior point methods (Q1174841) (← links)
• A brief description of ALPO (Q1186950) (← links)
• Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
• A diagonal quadratic approximation method for large scale linear programs (Q1200793) (← links)
• A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
• Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← links)
• Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
• Interior dual proximal point algorithm for linear programs (Q1333478) (← links)
• Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) (← links)
• Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
• Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
• On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method (Q1816897) (← links)
• A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems (Q1871426) (← links)
• A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
• Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
• (Q3164694) (← links)
• An efficient linear programming solver for optimal filter synthesis (Q3392865) (← links)
• Exploiting Special Structure in Primal Dual Interior Point Methods (Q3993666) (← links)
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^† (Q4227923) (← links)
• SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS (Q4242704) (← links)
• Stable algorithm for updating dense<i>LU</i>factorization after row or column exchange and row and column addition or deletion (Q4327873) (← links)
• Improvement of the Inside-Outside Duality Method (Q4562848) (← links)
• Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)