A new full-Newton step feasible interior point method for convex quadratic programming

DOI10.1080/02331934.2023.2169047MaRDI QIDQ6492473

Djamel Benterki, Nawel Boudjellal

Publication date: 25 April 2024

Published in: Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Cites Work

• A new primal-dual path-following method for convex quadratic programming
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
• A full-Newton step interior-point method for monotone weighted linear complementarity problems
• Lectures on Modern Convex Optimization
• A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new full-Newton step feasible interior point method for convex quadratic programming