A wide neighborhood interior-point algorithm based on the trigonometric kernel function

DOI10.1007/s12190-020-01347-2zbMath1475.90034OpenAlexW3016754845MaRDI QIDQ2053067

M. Haghighi, Behrouz Kheirfam

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01347-2

zbMATH Keywords

interior-point methodkernel functionlinear optimizationpolynomial complexitywide neighborhood

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• A new polynomial-time algorithm for linear programming
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
• A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
• A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
• 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
• A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
• An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

This page was built for publication: A wide neighborhood interior-point algorithm based on the trigonometric kernel function