Pages that link to "Item:Q1094330"
From MaRDI portal
The following pages link to A polynomial Newton method for linear programming (Q1094330):
Displayed 44 items.
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- A polynomial-time algorithm to decide liveness of bounded free choice nets (Q1193656) (← links)
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming (Q1194852) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- A projective algorithm for linear programming with no regularity condition (Q1200753) (← links)
- Recurrent neural networks for linear programming: Analysis and design principles (Q1200825) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368) (← links)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- A path-following version of the Todd-Burrell procedure for linear programming (Q1374685) (← links)
- On well definedness of the central path (Q1807813) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
- Linear updates for a single-phase projective method (Q2276876) (← links)
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex (Q3777792) (← links)
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs (Q4450560) (← links)
- On the symmetric affiine scaling algorithm for line programming<sup>*</sup> (Q4764582) (← links)
- An alternative derivation of the projective interior point method for linear programming through the least squares approach (Q4764596) (← links)
- Search directions for a class of projective methods (Q5752283) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)