Novel interior point algorithms for solving nonlinear convex optimization problems

DOI10.1155/2015/487271MaRDI QIDQ1748456zbMATH OpenOpenAlexWikidataFDO

Authors Sakineh Tahmasebzadeh, Hamidreza Navidi, Alaeddin Malek

Publication date 11 May 2018

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

Copyright license Creative Commons Attribution 3.0 Unported

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)

Recommendations

• On some efficient interior point methods for nonlinear convex programming
• A polynomial path following algorithm for convex programming
• An interior-point algorithm for nonconvex nonlinear programming
• scientific article; zbMATH DE number 269555
• An interior point algorithm for global optimal solutions and KKT points

Cites work

• scientific article; zbMATH DE number 412110 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• A new fast algorithm based on Karmarkar's gradient projected method for solving linear programming problems
• A new polynomial-time algorithm for linear programming
• A primal-infeasible interior point algorithm for linearly constrained convex programming
• A weighted path-following method for linearly constrained convex programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Extension of a projective interior point method for linearly constrained convex programming
• George Dantzig's impact on the theory of computation

Cited in

(3)

• scientific article; zbMATH DE number 1150096 (Why is no real title available?)
• Theoretical justification of interior point algorithms for solving optimization problems with nonlinear constraints
• On some efficient interior point methods for nonlinear convex programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748456)