A variation on Karmarkar’s algorithm for solving linear programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4085412
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- scientific article; zbMATH DE number 4170639
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- A modification of Karmarkar's linear programming algorithm
- scientific article; zbMATH DE number 1135749
- scientific article; zbMATH DE number 892376
- An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope
- On the number of iterations of Karmarkar's algorithm for linear programming
- Karmarkar's algorithm and the ellipsoid method
Cites work
Cited in
(only showing first 100 items - show all)- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Exploiting special structure in Karmarkar's linear programming algorithm
- A relaxed version of Karmarkar's method
- Linear programming and the Newton barrier flow
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- An interior point algorithm for semi-infinite linear programming
- An optimal-basis identification technique for interior-point linear programming algorithms
- Karmarkar's linear programming algorithm and Newton's method
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A primal projective interior point method for linear programming
- A hybrid method for the nonlinear least squares problem with simple bounds
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Comparative analysis of affine scaling algorithms based on simplifying assumptions
- Improving the rate of convergence of interior point methods for linear programming
- A survey of search directions in interior point methods for linear programming
- On the convergence of the affine-scaling algorithm
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- A polynomial method of approximate centers for linear programming
- Prior reduced fill-in in solving equations in interior point algorithms
- Todd's low-complexity algorithm is a predictor-corrector path-following method
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- Strict monotonicity in Todd's low-complexity algorithm for linear programming
- An interior point method for quadratic programs based on conjugate projected gradients
- A weighted least squares study of robustness in interior point linear programming
- Affine scaling algorithm fails for semidefinite programming
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Selected bibliography on degeneracy
- Degeneracy in interior point methods for linear programming: A survey
- A simplified global convergence proof of the affine scaling algorithm
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- On solution-containing ellipsoids in linear programming
- On the big \({\mathcal M}\) in the affine scaling algorithm
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- Interior-point algorithms for semi-infinite programming
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- Stable barrier-projection and barrier-Newton methods in linear programming
- Scaling, shifting and weighting in interior-point methods
- Gradient systems in view of information geometry
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
- A partial first-order affine-scaling method
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- Symmetric indefinite systems for interior point methods
- Exploiting special structure in a primal-dual path-following algorithm
- Efficient solution of two-stage stochastic linear programs using interior point methods
- Affine-scaling for linear programs with free variables
- An implementation of Karmarkar's algorithm for linear programming
- Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
- Some variants of the Todd low-complexity algorithm
- A relaxed primal-dual path-following algorithm for linear programming
- A simple proof of a primal affine scaling method
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- A convergence analysis for a convex version of Dikin's algorithm
- The primal power affine scaling method
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
- A trust region affine scaling method for bound constrained optimization
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- The method of global equilibrium search
- A direct heuristic algorithm for linear programming
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
- Entering into the domain of feasible solutions using interior point method
- Interior point method: history and prospects
- Generalized affine scaling algorithms for linear programming problems
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Superlinear convergence of the affine scaling algorithm
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
- A stochastic improvement method for stochastic programming
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- Search directions for interior linear-programming methods
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- Affine scaling with degenerate linear programming problems
- Loss and retention of accuracy in affine scaling methods
- An affine-scaling pivot algorithm for linear programming
- A trust region method based on a new affine scaling technique for simple bounded optimization
- Concise algorithm for linear programs in \texttt{Matlab}: monotonic convergence, basic variables, boundedness
- A Collinear Scaling Interpretation of Karmarkar’s Linear Programming Algorithm
- Interior-point methods for linear programming: a review
- A modified scaling algorithm for LP
- El metodo de Karmarkar: Un estudio de sus variantes
- scientific article; zbMATH DE number 5004702 (Why is no real title available?)
- scientific article; zbMATH DE number 4170639 (Why is no real title available?)
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
- A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
- Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema
- scientific article; zbMATH DE number 14316 (Why is no real title available?)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming
- A new variant of the primal affine scaling algorithm for linear programs
- Insights into the interior-point methods
- Convergence in Karmarkar's algorithm: a review
- Impproving the rate of convergence of the logarithmic barrier function method
- A circular cone relaxation primal interior point algorithm for LP
This page was built for publication: A variation on Karmarkar’s algorithm for solving linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030578)
