A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function

DOI10.1080/02331934.2015.1080255zbMath1338.90456OpenAlexW2271277839MaRDI QIDQ2810097

Behrouz Kheirfam, M. Haghighi

Publication date: 31 May 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2015.1080255

zbMATH Keywords

linear optimizationinfeasible interior-point methodfull-Newton steptrigonometric kernel function

Mathematics Subject Classification ID

Interior-point methods (90C51)

Related Items (7)

An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function ⋮ A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood ⋮ Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function

Cites Work

• Unnamed Item
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
• Feasibility issues in a primal-dual interior-point method for linear programming
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A unified approach to interior point algorithms for linear complementary problems
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Analytic Inequalities

This page was built for publication: A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function