Finding a strict feasible dual solution of a convex optimization problem

DOI10.1007/S13370-014-0315-2zbMath1332.90274OpenAlexW1975135429MaRDI QIDQ258326

El Amir Djeffal, Farouk Benoumelaz, Lakhdar Djeffal

Publication date: 10 March 2016

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-014-0315-2

zbMATH Keywords

quadratic programminginterior point methodsconvex nonlinear programming

Mathematics Subject Classification ID

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

Cites Work

• Finding a strict feasible solution of a linear semidefinite program
• Feasibility issues in a primal-dual interior-point method for linear programming
• A polynomial path following algorithm for convex programming
• A modified algorithm for the strict feasibility problem
• Unnamed Item

This page was built for publication: Finding a strict feasible dual solution of a convex optimization problem