scientific article; zbMATH DE number 6515403
From MaRDI portal
Publication:3454068
Recommendations
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
- Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
- A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
Cited in
(12)- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
- scientific article; zbMATH DE number 5629815 (Why is no real title available?)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- A new primal-dual interior-point algorithm for convex quadratic optimization
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454068)