Novel interior point algorithms for solving nonlinear convex optimization problems

DOI10.1155/2015/487271zbMath1387.90192OpenAlexW1795408808WikidataQ59103513 ScholiaQ59103513MaRDI QIDQ1748456

Hamidreza Navidi, Sakineh Tahmasebzadeh, Alaeddin Malek

Publication date: 11 May 2018

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/487271

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Interior-point methods (90C51)

Cites Work

• A new polynomial-time algorithm for linear programming
• George Dantzig's impact on the theory of computation
• Extension of a projective interior point method for linearly constrained convex programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Novel interior point algorithms for solving nonlinear convex optimization problems