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
From MaRDI portal
Publication:2361520
DOI10.1007/s13370-016-0455-7zbMath1365.90270OpenAlexW2515820577MaRDI QIDQ2361520
Publication date: 30 June 2017
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-016-0455-7
Related Items
A generic kernel function for interior point methods, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
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
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Monotone functions on formally real Jordan algebras
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- 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
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
