Pages that link to "Item:Q1108927"
From MaRDI portal
The following pages link to A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927):
Displaying 23 items.
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS (Q5035348) (← links)
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
- Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
- Minimum Point-Overlap Labeling (Q5283379) (← links)
- Some results on centers of polytopes (Q5312753) (← links)
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve (Q5458347) (← links)
- Properties Of Primal Interior Point Methods For QP<sup>∗</sup> (Q5689843) (← links)
- Search directions for a class of projective methods (Q5752283) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)
- The aggregate constraint homotopy method for nonconvex nonlinear programming (Q5946387) (← links)
- Maintaining closeness to the analytic center of a polytope by perturbing added hyperplanes (Q5961567) (← links)
- Extended Newton's method with applications to interior point algorithms of mathematical programming (Q6106828) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- Finite convergence into a convex polytope via facet reflections. (Q6175140) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
- Random projections for linear programming: an improved retrieval phase (Q6579780) (← links)
- Set-limited functions and polynomial-time interior-point methods (Q6596326) (← links)
- A quick estimate for the volume of a polyhedron (Q6635461) (← links)
