A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function-Reference-Cited by-同舟云学术

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

Published:2020-04-09 Issue:8 Volume:70 Page:1703-1724
ISSN:0233-1934
Container-title:Optimization
language:en
Short-container-title:Optimization

Author:

Boudjellal N.¹,Roumili H.¹,Benterki DJ.¹

Affiliation:

1. Faculty of Sciences, Laboratory of Fundamental and Numerical Mathematics, Department of Mathematics, University Ferhat Abbas Setif-1, Setif, Algeria

Publisher

Informa UK Limited

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

https://www.tandfonline.com/doi/pdf/10.1080/02331934.2020.1751156

Reference17 articles.

1. Primal-Dual Interior-Point Methods

2. A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

3. Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function

4. Complexity analysis of interior point methods for linear programming based on a parameterized kernel function

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Full-Newton Step Interior-Point Method for Weighted Quadratic Programming Based on the Algebraic Equivalent Transformation;Mathematics;2024-04-07

2. A Large-update Primal-dual Interior-point Algorithm for Convex Quadratic Optimization Based on a New Bi-parameterized Bi-hyperbolic Kernel Function;Lobachevskii Journal of Mathematics;2024-03

3. Interior-point algorithm for linear programming based on a new descent direction;RAIRO - Operations Research;2023-09

4. A new full-Newton step feasible interior point method for convex quadratic programming;Optimization;2023-01-30

5. An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming;Numerical Analysis and Applications;2022-06