Pages that link to "Item:Q1319020"

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

Displayed 21 items.

• 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)
• Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (Q940836) ‎ (← 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)
• 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)
• 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)
• On free variables in interior point methods (Q4391291) ‎ (← links)
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones (Q4504796) ‎ (← links)
• POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING (Q4650618) ‎ (← links)
• (Q4953319) ‎ (← links)
• ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING (Q5315980) ‎ (← links)
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution (Q5481687) ‎ (← links)
• An easy way to teach interior-point methods. (Q5932020) ‎ (← links)