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

DOI10.1007/S12190-020-01347-2MaRDI QIDQ2053067zbMATH OpenOpenAlexFDO

Authors Behrouz Kheirfam, M. Haghighi

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

polynomial complexitykernel functionwide neighborhoodlinear optimizationinterior-point method

Mathematics Subject Classification ID

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

Recommendations

• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
• Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
• A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
• A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
• A new polynomial-time algorithm for linear programming
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
• A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term

Cited in

(2)

• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053067)