Results 121 to 130 of about 17,647,919 (136)

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 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 New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming

Journal of Optimization Theory and Applications, 2015
Ximei Yang, Yinkui Zhang
exaly  

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

SIAM Journal on Optimization, 2015
Kees
exaly  

Simplified O(nL) Infeasible Interior-Point Algorithm for Linear Optimization Using Full-Newton Steps

Optimization Methods and Software, 2007
Kees, H Mansouri
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  

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

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

A Primal—Dual Infeasible-Interior-Point Algorithm for Linear Programming

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