Pages that link to "Item:Q1315419"
From MaRDI portal
The following pages link to A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419):
Displayed 41 items.
- A combined homotopy interior point method for the linear complementarity problem (Q849782) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Steplengths in interior-point algorithms of quadratic programming (Q1306349) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138) (← links)
- An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization (Q1363416) (← links)
- Parallel interior-point method for linear and quadratic programs with special structure (Q1608140) (← links)
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming (Q1894948) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← 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)
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption (Q1915917) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
- The \(Q\) method for second order cone programming (Q2459387) (← links)
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (Q2477012) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
- Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> (Q4227923) (← links)
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup> (Q4235448) (← links)
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs (Q4391295) (← links)
- LOQO:an interior point code for quadratic programming (Q4504789) (← links)
- (Q4953319) (← links)
- ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING (Q5315980) (← links)
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems (Q5892653) (← links)
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems (Q5892655) (← links)
- Solving linear systems in interior-point methods (Q5959078) (← links)