Novel Interior Point Algorithms for Solving Nonlinear Convex Optimization Problems

This paper proposes three numerical algorithms based on Karmarkar’s interior point technique for solvingnonlinear convex programming problems subject to linear constraints. The first algorithm uses the Karmarkaridea and linearization of the objective function. The second and third algorithms are mod...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Advances in Operations Research Ročník 2015; číslo 2015; s. 59 - 65
Hlavní autori: Tahmasebzadeh, Sakineh, Malek, Alaeddin, Navidi, H. R.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cairo, Egypt Hindawi Limiteds 01.01.2015
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Predmet:
Algorithms
Analysis
Convex programming
Linear programming
Mathematical optimization
Methods
Operations research
Optimization
Simplex method
United States
ISSN:1687-9147, 1687-9155
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper proposes three numerical algorithms based on Karmarkar’s interior point technique for solvingnonlinear convex programming problems subject to linear constraints. The first algorithm uses the Karmarkaridea and linearization of the objective function. The second and third algorithms are modification ofthe first algorithm using the Schrijver and Malek-Naseri approaches, respectively. These three novel schemesare tested against the algorithm of Kebiche-Keraghel-Yassine (KKY). It is shown that these three novel algorithmsare more efficient and converge to the correct optimal solution, while the KKY algorithm fails insome cases. Numerical results are given to illustrate the performance of the proposed algorithms.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1687-9147
1687-9155
DOI:10.1155/2015/487271