Results 201 to 210 of about 1,159 (214)

Infeasible Interior-Point Method Algorithms for LP

2020
openaire   +1 more source

Large-Update Infeasible Interior-Point Methods for Linear Optimization

2011
Recently, C. Roos proposed a full-Newton step infeasible interior-point method (IIPM) for linear optimization (LO). Shortly afterwards, Mansouri and Roos presented a variant of this algorithm and Gu et al. a version with a simplified analysis. Roos' algorithm is a path-following method.
openaire   +1 more source

A note on the de Ghellinck-Vial infeasible start interior point method

1999
The paper is a simplified exposition of an early combined phase I-phase II method for linear programming. The method works from an infeasible start.
openaire   +1 more source

A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems

Mathematics of Operations Research, 1996
Stephen Wright, Daniel Ralph
exaly  

Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points

SIAM Journal on Optimization, 1996
Michael Ferris, Stephen Billups
exaly  

A primal—dual infeasible-interior-point algorithm for linear programming

Mathematical Programming, 1993
Shinji Mizuno, Nimrod Megiddo, Masakazu Kojima   +2 more
exaly  

A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions

Applied Mathematics and Computation, 2011
Wenyu Sun
exaly  

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

SIAM Journal on Optimization, 2006
C Roos
exaly  

An infeasible-interior-point algorithm for linear complementarity problems

Mathematical Programming, 1994
Stephen Wright, Wright Stephen J
exaly  

CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming

Numerical Algorithms, 2016
Yaguang Yang
exaly