Pages that link to "Item:Q3200877"

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):

Displaying 50 items.

• A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
• A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
• A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
• Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
• A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
• 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)
• Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← 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)
• Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems (Q1312782) (← 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 wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← 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)
• Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
• A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
• An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204) (← links)
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
• Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)