Pages that link to "Item:Q687096"

The following pages link to On the finite convergence of interior-point algorithms for linear programming (Q687096):

Displaying 30 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• On the accurate identification of active set for constrained minimax problems (Q531696) (← 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 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)
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
• Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
• Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
• A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
• A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
• Solving linear systems involved in constrained optimization (Q1902118) (← links)
• Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
• Towards an efficient augmented Lagrangian method for convex quadratic programming (Q2191789) (← links)
• A rounding procedure for semidefinite optimization (Q2294267) (← 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)
• Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
• Symbolic implementation of interior point method for linear programming problem (Q3056355) (← links)
• Fortran subroutines for network flow optimization using an interior point algorithm (Q4905605) (← links)
• (Q4953319) (← links)
• Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity (Q5198048) (← links)
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution (Q5481687) (← links)
• A quantum interior-point predictor–corrector algorithm for linear programming (Q5871119) (← links)
• On the identification of the optimal partition for semidefinite optimization (Q5882391) (← links)
• An easy way to teach interior-point methods. (Q5932020) (← links)