Pages that link to "Item:Q3030578"

The following pages link to A variation on Karmarkar’s algorithm for solving linear programming problems (Q3030578):

Displaying 50 items.

• On the big \({\mathcal M}\) in the affine scaling algorithm (Q1321664) (← links)
• A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
• Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
• Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
• Stable barrier-projection and barrier-Newton methods in linear programming (Q1342880) (← links)
• Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
• Gradient systems in view of information geometry (Q1343026) (← links)
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← 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)
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. (Q1569192) (← links)
• A partial first-order affine-scaling method (Q1734900) (← links)
• Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
• Symmetric indefinite systems for interior point methods (Q1803613) (← links)
• Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
• Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
• Affine-scaling for linear programs with free variables (Q1812553) (← links)
• An implementation of Karmarkar's algorithm for linear programming (Q1824551) (← links)
• Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems (Q1904697) (← links)
• Some variants of the Todd low-complexity algorithm (Q1904958) (← links)
• A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
• A simple proof of a primal affine scaling method (Q1915916) (← links)
• An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption (Q1915917) (← links)
• A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← links)
• The primal power affine scaling method (Q1915919) (← links)
• Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm (Q1919098) (← links)
• A trust region affine scaling method for bound constrained optimization (Q1942658) (← links)
• Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
• The method of global equilibrium search (Q1968509) (← links)
• A direct heuristic algorithm for linear programming (Q1971659) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
• Entering into the domain of feasible solutions using interior point method (Q2290313) (← links)
• Interior point method: history and prospects (Q2300702) (← links)
• Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
• Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
• Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
• Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
• Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era (Q2390176) (← links)
• A stochastic improvement method for stochastic programming (Q2563621) (← links)
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
• Search directions for interior linear-programming methods (Q2639771) (← links)
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
• Affine scaling with degenerate linear programming problems (Q2743664) (← links)
• Loss and retention of accuracy in affine scaling methods (Q2778681) (← links)
• An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
• A trust region method based on a new affine scaling technique for simple bounded optimization (Q2867413) (← links)
• A Collinear Scaling Interpretation of Karmarkar’s Linear Programming Algorithm (Q3140007) (← links)
• Interior-point methods for linear programming: a review (Q3150491) (← links)