Finding a strict feasible dual solution of a convex optimization problem

DOI10.1007/S13370-014-0315-2MaRDI QIDQ258326zbMATH OpenOpenAlexFDO

Authors El Amir Djeffal, Lakhdar Djeffal, Farouk Benoumelaz

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)

Recommendations

• scientific article; zbMATH DE number 6164820
• Publication:4937595
• Finding a strict feasible solution of a linear semidefinite program
• On the Interpretation of Optimal Dual Solutions in Convex Programming
• The duality framework for constrained optimization problems
• Publication:3468887
• scientific article; zbMATH DE number 3902406
• A unified approach to duality in convex programming
• On the strong concavity of the dual function of an optimization problem
• Una caracterización dual de optimalidad para optimización convexa

Cites work

• A modified algorithm for the strict feasibility problem
• A polynomial path following algorithm for convex programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• Feasible short-step interior point algorithm for linear complementarity problem based on kernel function
• Finding a strict feasible solution of a linear semidefinite program

Cited in

(1)

• Finding a strict feasible solution of a linear semidefinite program

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

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