A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions

Optimization ◽  
2018 ◽  
Vol 67 (6) ◽  
pp. 889-905 ◽  
Author(s):  
Petra Renáta Takács ◽  
Zsolt Darvay
2010 ◽  
Vol 51 (4) ◽  
pp. 476-491 ◽  
Author(s):  
G. M. CHO ◽  
Y. Y. CHO ◽  
Y. H. LEE

AbstractWe propose a new primal-dual interior-point algorithm based on a new kernel function for linear optimization problems. New search directions and proximity functions are proposed based on the kernel function. We show that the new algorithm has $\mathcal {O}(\sqrt {n} \log n \log ({n}/{\epsilon }))$ and $\mathcal {O}(\sqrt {n}\log ({n}/{\epsilon }))$ iteration bounds for large-update and small-update methods, respectively, which are currently the best known bounds for such methods.


2020 ◽  
Vol 129 ◽  
pp. 106082
Author(s):  
Lianying Chao ◽  
Jiefei Han ◽  
Lisong Yan ◽  
Liying Sun ◽  
Fan Huang ◽  
...  

2013 ◽  
Vol 774-776 ◽  
pp. 1873-1876 ◽  
Author(s):  
Zhen Chen ◽  
Chen Liang ◽  
Run Qing Bai ◽  
Chao Ma ◽  
Lei Gao

This paper introduces a method for optimal reactive power compensation considering SVC. Static load margin of each node is calculated and then sorted to determine the location of reactive power compensation. To know the optimal compensating capacity, the mathematical model of fuzzy multi-objective is established, and it can be solved by the primal-dual interior point algorithm. The proposed method is applied to a grid of Northwest China with satisfactory results.


Sign in / Sign up

Export Citation Format

Share Document