A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
From MaRDI portal
Publication:2266861
DOI10.1007/s10114-009-6457-8zbMath1184.90099OpenAlexW2080700992MaRDI QIDQ2266861
Jin-Li Guo, Cornelis Roos, Yan-Qin Bai
Publication date: 26 February 2010
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-009-6457-8
Related Items
A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds, Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, The accuracy of interior-point methods based on kernel functions, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, New parameterized kernel functions for linear optimization, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Unnamed Item, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Cites Work
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
