The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions

2000 ◽  
Vol 87 (3) ◽  
pp. 501-517 ◽  
Author(s):  
Song Xu
Keyword(s):  
Complementarity Problems ◽  
Path Following ◽  
Linear Convergence ◽  
Global Linear Convergence ◽  
Path Following Algorithm

Plynomial Convergence of Primal-Dual Algorithms for SDLCP Based on the Monteiro-Zhang Family of Directions

2012 ◽  
Vol 532-533 ◽  
pp. 1857-1860
Author(s):  
Guang Zhou Li
Keyword(s):  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Path Following ◽  
Complexity Bounds ◽  
New Class ◽  
Primal Dual ◽  
Carry Over ◽  
Path Following Methods ◽  
Finite Linear ◽  
Path Following Algorithm

The paper establishes the polynomial converge-nce of a new class of path-following methods for semide- finite linear complementarity problems (SDLCP) whos-se search directions belong to the class of directions introduced by Monteiro [7]. Namely, we show that the polynomial iteration complexity bounds of the well known algori-thm for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP

scholarly journals Broken lines path following algorithm for a water-jet propulsion USV with disturbance uncertainties

2020 ◽  
Vol 201 ◽  
pp. 107118 ◽  
Author(s):  
Yujiao Zhao ◽  
Xin Qi ◽  
Atilla Incecik ◽  
Yong Ma ◽  
Zhixiong Li
Keyword(s):  
Path Following ◽  
Water Jet ◽  
Jet Propulsion ◽  
Disturbance Uncertainties ◽  
Path Following Algorithm
Sign in / Sign up

Export Citation Format

Share Document