A wide neighborhood interior-point algorithm based on the trigonometric kernel function
type: Item
instance of: scholarly article
title: A wide neighborhood interior-point algorithm based on the trigonometric kernel function
zbMATH Open document ID: 1475.90034
author: Behrouz Kheirfam
author: M. Haghighi
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7435127
zbMATH Keywords: linear optimization
zbMATH Keywords: wide neighborhood
zbMATH Keywords: kernel function
zbMATH Keywords: interior-point method
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s12190-020-01347-2
OpenAlex ID: W3016754845
cites work: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
cites work: A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
cites work: A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
cites work: A new polynomial-time algorithm for linear programming
cites work: An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
cites work: A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
cites work: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
cites work: A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
cites work: Q3491304
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
cites work: An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
cites work: Q4206561
cites work: Q4791754
cites work: Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
cites work: Q4339096
cites work: Q3738934
cites work: Q5691079
cites work: A wide neighborhood infeasible-interior-point method with arc-search for linear programming
cites work: Q4382667
DOI: 10.1007/S12190-020-01347-2
description: scientific article; zbMATH DE number 7435127