A variation on Karmarkar’s algorithm for solving linear programming problems
From MaRDI portal
Publication:3030578
DOI10.1007/BF02592024zbMath0626.90052OpenAlexW2026021734MaRDI QIDQ3030578
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592024
Related Items
A Polynomial Method of Weighted Centers for Convex Quadratic Programming, A new variant of the primal affine scaling algorithm for linear programs, Interior Point Algorithms in Linear Optimization, Insights into the interior-point methods, Convergence in Karmarkar's algorithm: a review, An affine scaling method using a class of differential barrier functions: primal approach, An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions, Impproving the rate of convergence of the logarithmic barrier function method, 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, Matrix partitioning methods for interior point algorithms., El metodo de Karmarkar: Un estudio de sus variantes, A circular cone relaxation primal interior point algorithm for LP, On the symmetric affiine scaling algorithm for line programming*, An alternative derivation of the projective interior point method for linear programming through the least squares approach, Superlinear convergence of the affine scaling algorithm, Interior-point algorithms for semi-infinite programming, Convergence property of the Iri-Imai algorithm for some smooth convex programming problems, 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, 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, Computational experience with a dual affine variant of Karmarkar's method for linear 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, Exploiting special structure in Karmarkar's linear programming algorithm, Improved complexity using higher-order correctors for primal-dual Dikin affine scaling, Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems, Some variants of the Todd low-complexity algorithm, Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era, A relaxed version of Karmarkar's method, Linear programming and the Newton barrier flow, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case, 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, An extension of Karmarkar's projective algorithm for convex quadratic programming, Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm, An interior point algorithm for semi-infinite linear programming, Trust region affine scaling algorithms for linearly constrained convex and concave programs, A trust region affine scaling method for bound constrained optimization, Cubically convergent method for locating a nearby vertex in linear programming, Asymptotic behaviour of Karmarkar's method for linear programming, Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis, A survey of dynamic network flows, Dual interior point algorithms, Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era, The method of global equilibrium search, 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 direct heuristic algorithm 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, A partial first-order affine-scaling method, Affine scaling with degenerate linear programming problems, 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, The \(\ell_1\) solution of linear inequalities, A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions, Convergence behavior of interior-point algorithms, Solving linear program as linear system in polynomial time, Loss and retention of accuracy in affine scaling methods, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, A modified scaling algorithm for LP, The steepest descent gravitational method 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, 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, An interior point method for quadratic programs based on conjugate projected gradients, A weighted least squares study of robustness in interior point linear programming, Interior point method: history and prospects, Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm, On the asymptotic behavior of the projective rescaling algorithm for linear programming, Affine-scaling for linear programs with free variables, An implementation of Karmarkar's algorithm for linear programming, \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation., An affine-scaling pivot algorithm for linear programming, Affine scaling algorithm fails for semidefinite programming, Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach, A stochastic improvement method for stochastic programming, Polynomial primal-dual cone affine scaling for semidefinite programming, Generalized affine scaling algorithms for linear programming problems, Lagrangian transformation and interior ellipsoid methods in convex optimization, A unified view of interior point methods for linear programming, Feasibility issues in a primal-dual interior-point method for linear 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, A trust region method based on a new affine scaling technique for simple bounded optimization, On monotonicity in the scaled potential algorithm for linear programming, The affine-scaling direction for linear programming is a limit of projective-scaling directions, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, 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 methods for linear programming: a review
Cites Work
