- Tytuł:
- A primal-infeasible interior point algorithm for linearly constrained convex programming
- Autorzy:
-
Wang, Y.
Fei, P. - Powiązania:
- https://bibliotekanauki.pl/articles/969664.pdf
- Data publikacji:
- 2009
- Wydawca:
- Polska Akademia Nauk. Instytut Badań Systemowych PAN
- Tematy:
-
linearly constrained convex programming
primal-infeasible interior point algorithm
polynomial complexity - Opis:
- In this paper a primal-infeasible interior point algorithm is proposed for linearly constrained convex programming. A positive primal-infeasible dual-feasible point can be taken as the starting point of this algorithm in a large region. At each iterates it requires to solve approximately a nonlinear system. The polynomial complexity of the algorithm is obtained. It is shown that, after finite iterations a sufficiently good approximation to the optimal point is found, or there is no optimal point in a large region.
- Źródło:
-
Control and Cybernetics; 2009, 38, 3; 687-704
0324-8569 - Pojawia się w:
- Control and Cybernetics
- Dostawca treści:
- Biblioteka Nauki
Artykuł