The following pages link to (Q3033554):
Displaying 28 items.
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- PageRank optimization by edge selection (Q2449060) (← links)
- (Q4719012) (← links)
- Simultaneous perception-action design via invariant finite belief sets (Q6110013) (← links)
- A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming (Q6166646) (← links)
- IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga (Q6195051) (← links)
- Gradient preserving operator inference: data-driven reduced-order models for equations with gradient structure (Q6557793) (← links)
