Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming

Numerical Algorithms ◽

10.1007/s11075-018-0469-3 ◽

2018 ◽

Vol 79 (3) ◽

pp. 957-992 ◽

Author(s):

Y. Yang

Keyword(s):

Linear Programming ◽

Interior Point ◽

Computationally Efficient ◽

Interior Point Algorithms

Download Full-text

Polynomiality of infeasible-interior-point algorithms for linear programming

Mathematical Programming ◽

10.1007/bf01582216 ◽

1994 ◽

Vol 67 (1-3) ◽

pp. 109-119 ◽

Author(s):

Shinji Mizuno

Keyword(s):

Linear Programming ◽

Interior Point ◽

Interior Point Algorithms

Download Full-text

On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

SIAM Journal on Optimization ◽

10.1137/s1052623495296115 ◽

1998 ◽

Vol 8 (2) ◽

pp. 365-386 ◽

Author(s):

Yin Zhang

Keyword(s):

Linear Programming ◽

Semidefinite Programming ◽

Interior Point ◽

Interior Point Algorithms ◽

Download Full-text

Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems

SIAM Journal on Optimization ◽

10.1137/s1052623497329993 ◽

2000 ◽

Vol 11 (1) ◽

pp. 133-148 ◽

Author(s):

Janos Korzak

Keyword(s):

Linear Programming ◽

Convergence Analysis ◽

Interior Point ◽

Interior Point Algorithms ◽

Linear Programming Problems

Download Full-text

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming

Mathematics of Operations Research ◽

10.1287/moor.18.4.964 ◽

1993 ◽

Vol 18 (4) ◽

pp. 964-981 ◽

Author(s):

Shinji Mizuno ◽

Michael J. Todd ◽

Yinyu Ye

Keyword(s):

Linear Programming ◽

Interior Point ◽

Interior Point Algorithms ◽

Primal Dual ◽

Download Full-text

Boundary Behavior of Interior Point Algorithms in Linear Programming

Mathematics of Operations Research ◽

10.1287/moor.14.1.97 ◽

1989 ◽

Vol 14 (1) ◽

pp. 97-146 ◽

Author(s):

Nimrod Megiddo ◽

Michael Shub

Keyword(s):

Linear Programming ◽

Interior Point ◽

Boundary Behavior ◽

Interior Point Algorithms

Download Full-text

Optimal design of steel telecommunication towers by interior point algorithms for non-linear programming

Thin-Walled Structures - Advances and Developments ◽

10.1016/b978-008043955-6/50058-6 ◽

2001 ◽

pp. 533-540

Author(s):

N.A. Cerqueira ◽

G.S.A. Falcon ◽

J.G.S. da Silva ◽

F.J. da C.P. Soeiro

Keyword(s):

Linear Programming ◽

Optimal Design ◽

Interior Point ◽

Interior Point Algorithms ◽

Non Linear Programming ◽

Telecommunication Towers

Download Full-text

On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming

Mathematics of Operations Research ◽

10.1287/moor.22.2.408 ◽

1997 ◽

Vol 22 (2) ◽

pp. 408-431 ◽

Author(s):

Jos F. Sturm ◽

Shuzhong Zhang

Keyword(s):

Linear Programming ◽

Interior Point ◽

Wide Region ◽

Interior Point Algorithms ◽

Download Full-text

On the finite convergence of interior-point algorithms for linear programming

Mathematical Programming ◽

10.1007/bf01581087 ◽

1992 ◽

Vol 57 (1-3) ◽

pp. 325-335 ◽

Author(s):

Yinyu Ye

Keyword(s):

Linear Programming ◽

Interior Point ◽

Finite Convergence ◽

Interior Point Algorithms

Download Full-text

Theoretical convergence of large-step primal—dual interior point algorithms for linear programming

Mathematical Programming ◽

10.1007/bf01581234 ◽

1993 ◽

Vol 59 (1-3) ◽

pp. 1-21 ◽

Author(s):

Masakazu Kojima ◽

Nimrod Megiddo ◽

Shinji Mizuno

Keyword(s):

Linear Programming ◽

Interior Point ◽

Interior Point Algorithms ◽

Download Full-text

Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities

Optimization ◽

10.1080/02331934.2016.1244268 ◽

2016 ◽

Vol 66 (12) ◽

pp. 2063-2086

Author(s):

Alexander Engau ◽

Miguel F. Anjos

Keyword(s):

Linear Programming ◽

Interior Point ◽

Interior Point Algorithms ◽

Primal Dual ◽

Selective Addition

Download Full-text