Pages that link to "Item:Q1804652"

The following pages link to A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652):

Displaying 21 items.

• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
• An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
• An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
• On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← 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)
• On the convergence analysis of arc search interior point methods for LCPs (Q2337791) (← links)
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
• The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
• LOQO:an interior point code for quadratic programming (Q4504789) (← links)
• An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step (Q4635027) (← links)
• Infeasible constraint-reduced interior-point methods for linear optimization (Q5200562) (← links)
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)