A new path following algorithm with uncertainty information of robot's initial position and its implementation

Author(s):  
Jinke Li ◽  
Ruiqing Fu ◽  
Xinyu Wu ◽  
Jianquan Sun ◽  
Huiwen Guo ◽  
...  
2020 ◽  
Vol 201 ◽  
pp. 107118 ◽  
Author(s):  
Yujiao Zhao ◽  
Xin Qi ◽  
Atilla Incecik ◽  
Yong Ma ◽  
Zhixiong Li

2014 ◽  
Vol 07 (02) ◽  
pp. 1450028 ◽  
Author(s):  
Behrouz Kheirfam

A corrector–predictor algorithm is proposed for solving semidefinite optimization problems. In each two steps, the algorithm uses the Nesterov–Todd directions. The algorithm produces a sequence of iterates in a neighborhood of the central path based on a new proximity measure. The predictor step uses line search schemes requiring the reduction of the duality gap, while the corrector step is used to restore the iterates to the neighborhood of the central path. Finally, the algorithm has [Formula: see text] iteration complexity.


Sign in / Sign up

Export Citation Format

Share Document