scientific article; zbMATH DE number 7551027
From MaRDI portal
Publication:5085900
zbMath1491.90098MaRDI QIDQ5085900
Publication date: 30 June 2022
Full work available at URL: https://pjm.ppu.edu/sites/default/files/papers/PJM_Speciall_Issue_II_March_2022_127_to_135.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingcomplexity analysisprimal-dual interior point methodskernel functionslarge- and small-update methods
Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- An efficient parameterized logarithmic kernel function for linear optimization
- A new polynomial-time algorithm for linear programming
- An efficient twice parameterized trigonometric kernel function for linear optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- A generic kernel function for interior point methods
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
This page was built for publication:
