Pages that link to "Item:Q3200877"
From MaRDI portal
The following pages link to A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension (Q3200877):
Displayed 47 items.
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions (Q688916) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Warm start by Hopfield neural networks for interior point methods (Q875399) (← links)
- Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- Feasible direction interior-point technique for nonlinear optimization (Q1273166) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← 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)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- The primal power affine scaling method (Q1915919) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis (Q2483030) (← links)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema (Q3835654) (← links)
- An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665) (← links)
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard (Q4351192) (← links)
- A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants (Q4504778) (← links)
- On the symmetric affiine scaling algorithm for line programming<sup>*</sup> (Q4764582) (← links)
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
- A quadratically convergent scaling newton’s method for nonlinear programming problems (Q4944414) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)