A variable-metric variant of the Karmarkar algorithm for linear programming
From MaRDI portal
Recommendations
Cites work
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- A relaxed version of Karmarkar's method
- An experimental approach to karmarkar’s projective method for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
Cited in
(30)- Introduction: New approaches to linear programming
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- Implementing an affine scaling algorithm for linear programming
- Computing Karmarkar projections quickly
- A hybrid method for the nonlinear least squares problem with simple bounds
- Computational results of an interior point algorithm for large scale linear programming
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Interior proximal point algorithm for linear programs
- Practical quasi-Newton methods for solving nonlinear systems
- A class of polynomial variable metric algorithms for linear optimization
- Deriving Karmarkar's LP algorithm using angular projection matrix
- A global Weinstein splitting theorem for holomorphic Poisson manifolds
- Quasi-Newton approaches to interior point methods for quadratic problems
- An algorithm for solving nonlinear programming problems using Karmarkar's technique
- \(n\)-dimensional projective varieties with the action of an abelian group of rank \(n-1\)
- A note on automorphisms and birational transformations of holomorphic symplectic manifolds
- El metodo de Karmarkar: Un estudio de sus variantes
- scientific article; zbMATH DE number 4158373 (Why is no real title available?)
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- scientific article; zbMATH DE number 176432 (Why is no real title available?)
- scientific article; zbMATH DE number 1226308 (Why is no real title available?)
- Varieties with \(\mathbb {P}\)-units
- Automorphism groups of positive entropy on projective threefolds
- Compact Kähler manifolds with automorphism groups of maximal rank
- On the monodromy of moduli spaces of sheaves on K3 surfaces
- Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming
- Computing projections for the Karmarkar algorithm
- A quadratically convergent method for linear programming
- Asymptotic behaviour of Karmarkar's method for linear programming
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
This page was built for publication: A variable-metric variant of the Karmarkar algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775323)
