Pages that link to "Item:Q1176568"
From MaRDI portal
The following pages link to Karmarkar's linear programming algorithm and Newton's method (Q1176568):
Displayed 13 items.
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- On the convex programming approach to linear programming (Q1180836) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Deriving an unconstrained convex program for linear programming (Q1321279) (← links)
- A global Newton method. II: Analytic centers (Q1321647) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- An interior point algorithm for nonlinear quantile regression (Q1915451) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- Search directions for interior linear-programming methods (Q2639771) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING (Q5318371) (← links)