A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
A new polynomial-time algorithm for linear programming
Self-regular functions and new search directions for linear and semidefinite optimization
A new and efficient large-update interior-point method for linear optimization
Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
Interior path following primal-dual algorithms. II: Convex quadratic programming
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
Kernel-function Based Algorithms for Semidefinite Optimization
A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
A primal‐dual interior-point method for linear optimization based on a new proximity function
A kernel function based interior-point methods for solving $P_{*}(\kappa )$-linear complementarity problem
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
A new primal-dual interior-point algorithm for convex quadratic optimization
Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function

Cited In (1)

Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function

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)