A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
From MaRDI portal
Publication:6586751
Cites Work
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- 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 parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP
- A new polynomial-time algorithm for linear programming
- A new primal-dual interior-point algorithm for convex quadratic optimization
- 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
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Kernel-function Based Algorithms for Semidefinite Optimization
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
- Self-regular functions and new search directions for linear and semidefinite optimization
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
This page was built for publication: A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586751)
