Pages that link to "Item:Q1123121"
From MaRDI portal
The following pages link to Interior path following primal-dual algorithms. I: Linear programming (Q1123121):
Displaying 50 items.
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- A multiobjective interior primal-dual linear programming algorithm (Q1318462) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176) (← links)
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Rank-one techniques in log-barrier function methods for linear programming (Q1333365) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← 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 combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337) (← links)
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
- A sublinear parallel algorithm for stable matching (Q1575960) (← links)
- Monotone variable-metric algorithm for linearly constrained nonlinear programming (Q1579655) (← links)
- Higher-order derivatives in linear and quadratic programming (Q1592581) (← links)
- An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method (Q1610185) (← links)
- On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
- A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- Symmetric indefinite systems for interior point methods (Q1803613) (← links)
- Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652) (← links)
- On well definedness of the central path (Q1807813) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Computing Karmarkar's projections quickly by using matrix factorization (Q1815744) (← links)
- Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
