A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function

DOI10.1080/02331934.2020.1751156zbMath1476.90227OpenAlexW3015776814MaRDI QIDQ5009163

No author found.

Publication date: 19 August 2021

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

kernel functionconvex quadratic programminginterior point methods

Mathematics Subject Classification ID

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

Related Items (3)

An efficient logarithmic barrier method without line search for convex quadratic programming ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
• A new primal-dual interior-point algorithm for convex quadratic optimization

This page was built for publication: A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function