Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
From MaRDI portal
Publication:806962
DOI10.1016/0024-3795(91)90265-XzbMATH Open0729.65040OpenAlexW1970687372WikidataQ114852088 ScholiaQ114852088MaRDI QIDQ806962FDOQ806962
Authors: Robert M. Freund 
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90265-x
Recommendations
Cites Work
- Title not available (Why is that?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- Conical projection algorithms for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A monotonic projective algorithm for fractional linear programming
- A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming
- Title not available (Why is that?)
- Optimization of “$\log x$” Entropy over Linear Equality Constraints
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- A variant of Karmarkar's linear programming algorithm for problems in standard form
Cited In (17)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- Active-set prediction for interior point methods using controlled perturbations
- Differential-algebraic approach to linear programming
- Scaling, shifting and weighting in interior-point methods
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- A shifted primal-dual penalty-barrier method for nonlinear optimization
- A combined homotopy interior point method for convex nonlinear programming
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- A combined phase I-phase II scaled potential algorithm for linear programming
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- The Newton modified barrier method for QP problems
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- A single-phase, proximal path-following framework
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
This page was built for publication: Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806962)
