A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension

Authors:
R. C. Monteiro;I. Adler;M. G.C. Resende
Affiliations:
-;-;-
Venue:
Mathematics of Operations Research
Year:
1990

Citing 0
Cited 7

On the Interplay among Entropy, Variable Metrics andPotential Functions in Interior-Point Algorithms

Computational Optimization and Applications
On the Rate of Local Convergence of High-Order-Infeasible-Path-Following Algorithms for P*-Linear Complementarity Problems

Computational Optimization and Applications
Postponing the Choice of Penalty Parameter and Step Length

Computational Optimization and Applications
Warm start by Hopfield neural networks for interior point methods

Computers and Operations Research
Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming

Applied Numerical Mathematics
A constraint-reduced variant of Mehrotra's predictor-corrector algorithm

Computational Optimization and Applications
A note on a potential reduction algorithm for LP with simultaneous primal-dual updating

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract