Pages that link to "Item:Q1312753"

The following pages link to Degeneracy in interior point methods for linear programming: A survey (Q1312753):

Displaying 15 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• The Cholesky factorization in interior point methods (Q815247) (← links)
• A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
• A weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
• Determination of an interior feasible point for a system of linear constraints (Q1280896) (← links)
• Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces (Q1290608) (← links)
• Selected bibliography on degeneracy (Q1312748) (← links)
• Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case (Q1372556) (← links)
• The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors (Q1596137) (← links)
• Non total-unimodularity neutralized simplicial complexes (Q1707913) (← links)
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
• A new proposal to improve the early iterations in the interior point method (Q2178307) (← links)
• The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
• Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)