New parameterized kernel functions for linear optimization
From MaRDI portal
Publication:693134
DOI10.1007/S10898-012-9934-ZzbMATH Open1254.90299OpenAlexW2004402240MaRDI QIDQ693134FDOQ693134
Jing Zhang, Wei Xie, Yanqin Bai
Publication date: 7 December 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9934-z
Recommendations
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- An efficient parameterized logarithmic kernel function for linear optimization
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
Cites Work
- Title not available (Why is that?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Nonlinear Programming
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
Cited In (7)
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
- Dislocation hyperbolic kernel function
- Title not available (Why is that?)
- An efficient twice parameterized trigonometric kernel function for linear optimization
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization
- The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function
This page was built for publication: New parameterized kernel functions for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693134)