A primal‐dual interior-point method for linear optimization based on a new proximity function
From MaRDI portal
Publication:4405935
DOI10.1080/1055678021000090024zbMath1032.90068OpenAlexW2022003008MaRDI QIDQ4405935
Cornelis Roos, M. El Ghami, Yan-Qin Bai
Publication date: 2002
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678021000090024
Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)
Related Items
Interior-point methods based on kernel functions for symmetric optimization, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, A new primal-dual interior-point algorithm for convex quadratic optimization, Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, The accuracy of interior-point methods based on kernel functions, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Interior-point algorithm based on general kernel function for monotone linear complementarity problem, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems, Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, A class of large-update and small-update primal-dual interior-point algorithms for linear optimization, Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior path following primal-dual algorithms. I: Linear programming
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- Path-Following Methods for Linear Programming
