Pages that link to "Item:Q1321176"
From MaRDI portal
The following pages link to Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176):
Displaying 12 items.
- On finding a vertex solution using interior point methods (Q1174841) (← links)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization (Q1363416) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- On the Newton interior-point method for nonlinear programming problems (Q1973482) (← links)
- On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447) (← links)
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)