Pages that link to "Item:Q3830814"
From MaRDI portal
The following pages link to Boundary Behavior of Interior Point Algorithms in Linear Programming (Q3830814):
Displaying 50 items.
- A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← links)
- The central curve in linear programming (Q695626) (← links)
- On the asymptotic behavior of the projective rescaling algorithm for linear programming (Q750290) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Feasible region contraction interior point algorithm (Q858800) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- Hamiltonian structure of dynamical systems which solve linear programming problems (Q1181368) (← links)
- Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
- Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- Integrability of vector and multivector fields associated with interior point methods for linear programming (Q1181913) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← 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 weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A simplified global convergence proof of the affine scaling algorithm (Q1312779) (← links)
- On the number of iterations of Karmarkar's algorithm for linear programming (Q1321670) (← links)
- Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming (Q1325127) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case (Q1372556) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- On well definedness of the central path (Q1807813) (← links)
- Polynomial affine algorithms for linear programming (Q1814590) (← links)
- An implementation of Karmarkar's algorithm for linear programming (Q1824551) (← links)
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- A boundary-point LP solution method and its application to dense linear programs (Q2205093) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds (Q2476985) (← links)
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization (Q2638937) (← links)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
- Affine scaling with degenerate linear programming problems (Q2743664) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)
- On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming (Q4016719) (← links)
- (Q4288560) (← links)
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard (Q4351192) (← links)
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS (Q4548041) (← links)
- The Convergent Generalized Central Paths for Linearly Constrained Convex Programming (Q4641644) (← links)
