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

DOI10.1080/02331934.2023.2169047MaRDI QIDQ6492473zbMATH OpenFDO

Authors Nawel Boudjellal, Djamel Benterki

Publication date 25 April 2024

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2023.2169047

Mathematics Subject Classification ID

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

Recommendations

• An infeasible interior-point algorithm for convex quadratic programming with full-Newton step
• scientific article; zbMATH DE number 7366754
• A stable interior point method for convex quadratic programming
• An interior Newton method for quadratic programming
• scientific article; zbMATH DE number 1094157

Cites work

• A full-Newton step interior-point method for monotone weighted linear complementarity problems
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• A new primal-dual path-following method for convex quadratic programming
• A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
• An infeasible interior point method for convex quadratic problems
• Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
• scientific article; zbMATH DE number 4100957 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• Infeasible primal-dual algorithm for minimizing convex quadratic problems
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• New interior point algorithms in linear programming

Cited in

(2)

• Complexity and numerical implementation of a new full-Newton step interior point method for weighted convex quadratic optimization
• An improved search direction based on algebraic equivalent transformation technique for convex quadratic optimization

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

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