Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions-Reference-Cited by-同舟云学术

Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions

Published:2007-09 Issue:9 Volume:57 Page:1033-1049
ISSN:0168-9274
Container-title:Applied Numerical Mathematics
language:en
Short-container-title:Applied Numerical Mathematics

Author:

Zhao Y.B.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics,Numerical Analysis

Reference24 articles.

1. A new infinity-norm path following algorithm for linear programming;Anstreicher;SIAM J. Optim.,1995

2. E.R. Barnes, S. Chopra, D.J. Jensen, The affine scaling method with centering, Technical Report, Department of Mathematical Sciences, IBM T.J. Watson Research Center, Yorktown Heights, NY, 1988

3. Karmarkar's linear programming algorithm and Newton's method;Bayer;Math. Programming,1991

4. Higher-order predictor–corrector interior point methods with application to quadratic objectives;Carpenter;SIAM J. Optim.,1993

5. Complexity of predictor–corrector algorithms for LCP based on a large neighborhood of the central path;Gonzaga;SIAM J. Optim.,2000

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Improved Interior Point Algorithm for Quantile Regression;IEEE Access;2020

2. Covered solution for a grey linear program based on a general formula for the inverse of a grey matrix;Grey Systems: Theory and Application;2014-01-28

3. Iron Ore Blending Based on Linear Programming;Applied Mechanics and Materials;2013-10

4. A novel LMI based swing-up robust controller for a serial double inverted pendulum;2009 IEEE International Conference on Robotics and Biomimetics (ROBIO);2009-12