Results 111 to 120 of about 996 (126)

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

An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization

SIAM Journal on Optimization, 2015
C Roos
exaly  

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

SIAM Journal on Optimization, 2006
C Roos
exaly  

A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming

Journal of Optimization Theory and Applications, 2014
Ximei Yang
exaly  

A New Wide Neighborhood Primal–Dual Infeasible-Interior-Point Method for Symmetric Cone Programming

Journal of Optimization Theory and Applications, 2013
Changhe Liu, Ximei Yang
exaly  

A Mehrotra-type predictor–corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization

Journal of Computational and Applied Mathematics, 2015
Changhe Liu, Ximei Yang
exaly  

SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps

Optimization Methods and Software, 2007
C Roos, H Mansouri
exaly  

A wide neighborhood infeasible-interior-point method with arc-search for linear programming

Journal of Applied Mathematics and Computing, 2015
Ximei Yang
exaly