Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming [PDF]
Computational Optimization and Applications, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefania Bellavia, Sandra Pieraccini
openaire +5 more sources
Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear Optimization [PDF]
Journal of Optimization Theory and Applications, 2008 This article studies the use of a primal-dual interior point method for solving large scale linear programs. The article begins with a presentation of the background to this problem and an overview of the existing literature, including the use of Preconditioned Conjugate Gradients (PCG) for inexact infeasible path-following algorithms.
Al-Jeiroudi, G., Gondzio, J.
openaire +4 more sources
An infeasible full NT-step interior point method for circular optimization
Numerical Algebra, Control & Optimization, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kheirfam, Behrouz, Wang, Guoqiang
openaire +5 more sources
Detecting Infeasibility in Infeasible-Interior-Point Methods for Optimization [PDF]
, 2003 Detecting Infeasibility in Infeasible-Interior-Point Methods for ...
Todd, M. J.
core +5 more sources
An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear Programming [PDF]
, 1995 An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear ...
Tutuncu, R.
core +6 more sources
Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric Cones [PDF]
, 2004 Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric ...
Rangarajan, B.
core +5 more sources
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2015 In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is
Asadi S., Mansouri H.
doaj +1 more source
Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood [PDF]
Journal of Optimization Theory and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asadi, A.R. (author), Roos, C. (author)
openaire +4 more sources
New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization [PDF]
Yugoslav Journal of Operations Research, 2018 We present a full Nesterov-Todd (NT) step infeasible interior-point algorithm for second-order cone optimization based on a different way to calculate feasibility direction. In each iteration of the algorithm we use the largest possible barrier parameter
Kheirfam Behrouz
doaj +1 more source
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
Croatian Operational Research Review, 2016 We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps.
Goran Lešaja, Mustafa Ozen
doaj +1 more source