Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO

In this paper, we present a primal-dual interior point algorithm for linearly constrained convex optimization (LCCO). The algorithm uses only full-Newton step to update iterates with an appropriate proximity measure for controlling feasible iterations near the central path during the solution proces...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical algorithms Ročník 70; číslo 2; s. 393 - 405
Hlavní autoři: Achache, Mohamed, Goutali, Moufida
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.10.2015
Springer Nature B.V
Témata:
Algebra
Algorithms
Complexity
Computer Science
Convexity
Numeric Computing
Numerical Analysis
Optimization
Original Paper
Polynomials
Theory of Computation
Interior point methods
90C51
Linearly constrained convex optimization
Short-step primal-dual algorithms
90C25
Complexity of algorithms
ISSN:1017-1398, 1572-9265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we present a primal-dual interior point algorithm for linearly constrained convex optimization (LCCO). The algorithm uses only full-Newton step to update iterates with an appropriate proximity measure for controlling feasible iterations near the central path during the solution process. The favorable polynomial complexity bound for the algorithm with short-step method is obtained, namely O ( n log n 𝜖 ) which is as good as the linear and convex quadratic optimization analogue. Numerical results are reported to show the efficiency of the algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-014-9955-4