Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
From MaRDI portal
Publication:2115211
Recommendations
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- Primal-dual interior point method based on a new barrier function
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- scientific article; zbMATH DE number 6515403
Cites work
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A feasible primal-dual interior point method for linear semidefinite programming
- A generic kernel function for interior point methods
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A new and efficient large-update interior-point method for linear optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A new polynomial-time algorithm for linear programming
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- An efficient twice parameterized trigonometric kernel function for linear optimization
- An Interior-Point Method for Semidefinite Programming
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 5289787 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 951459 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Self-regular functions and new search directions for linear and semidefinite optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(14)- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
- scientific article; zbMATH DE number 7551027 (Why is no real title available?)
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
- An efficient bi-parametric hyperbolic kernel function yielding the best known iteration bounds for linear programming
- An interior-point algorithm for LCP based on a parameterized hyperbolic kernel function
- Closing the iteration gap in linear programming with a new kernel function
- A novel kernel function bridging iteration bounds in interior-point algorithms for linear programming.
- An efficient 2-parameter hyperbolic kernel-function-based interior-point method for linear programming
- An infeasible interior-point algorithm for monotone linear complementarity problems based on a finite hyperbolic kernel function.
This page was built for publication: Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115211)
