A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
From MaRDI portal
Publication:3505061
DOI10.1017/S1446181100012827zbMath1142.90039OpenAlexW2025402112MaRDI QIDQ3505061
Publication date: 18 June 2008
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446181100012827
Related Items
Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function ⋮ Kernel function based interior-point methods for horizontal linear complementarity problems ⋮ A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO ⋮ Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions ⋮ Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term ⋮ A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION ⋮ An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ An efficient parameterized logarithmic kernel function for semidefinite optimization ⋮ An interior-point algorithm for linear optimization based on a new barrier function ⋮ Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ Large-update interior point algorithm for \(P_*\)-linear complementarity problem
Cites Work
- Self-regular functions and new search directions for linear and semidefinite optimization
- 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
