Infeasible primal-dual algorithm for minimizing convex quadratic problems

MaRDI QIDQ5309466zbMATH OpenFDO

Authors

Publication date 9 October 2007

zbMATH Keywords

convex quadratic programmingfeasible interior points methodsinfeasible interior points methods

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints
• On the Resolution of Linearly Constrained Convex Minimization Problems
• scientific article; zbMATH DE number 6610411
• Primal-dual method of solving convex quadratic programming problems
• Short-step primal-dual target-following algorithms for the convex quadratic problems

Cited in

(5)

• Quadratically constrained convex quadratic programmes: Faculty feasible regions
• On the Resolution of Linearly Constrained Convex Minimization Problems
• Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization
• A new full-Newton step feasible interior point method for convex quadratic programming
• A numerical study of an infeasible primal-dual path-following algorithm for linear programming

This page was built for publication: Infeasible primal-dual algorithm for minimizing convex quadratic problems

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