Pages that link to "Item:Q1319020"

The following pages link to Finding an interior point in the optimal face of linear programs (Q1319020):

Displaying 28 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
• Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (Q613275) (← links)
• A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
• Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem (Q670858) (← links)
• On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
• On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
• A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
• Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (Q940836) (← links)
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
• Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
• Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
• A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
• Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
• A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910) (← links)
• A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
• A general parametric analysis approach and its implication to sensitivity analysis in interior point methods (Q1919814) (← links)
• Relaxing the strong triadic closure problem for edge strength inference (Q1987174) (← links)
• The rankability of weighted data from pairwise comparisons (Q2069943) (← links)
• Fairness and the set of optimal rankings for the linear ordering problem (Q2168622) (← links)
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
• On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities (Q2463794) (← links)
• A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
• Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
• Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs (Q6049435) (← links)
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)