Pages that link to "Item:Q425872"
From MaRDI portal
The following pages link to On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872):
Displaying 11 items.
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886) (← links)
- An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions (Q5081279) (← links)
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming (Q6661713) (← links)
