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

DOI10.1080/02331934.2015.1080255zbMATH Open1338.90456OpenAlexW2271277839MaRDI QIDQ2810097FDOQ2810097

Authors: 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

Recommendations

• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A full-Newton step infeasible interior-point method for linear optimization based on an exponential kernel function
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function

zbMATH Keywords

infeasible interior-point methodlinear optimizationfull-Newton steptrigonometric kernel function

Mathematics Subject Classification ID

Interior-point methods (90C51)

Cites Work

• Analytic Inequalities
• A unified approach to interior point algorithms for linear complementary problems
• Self-regular functions and new search directions for linear and semidefinite optimization
• Title not available (Why is that?)
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• 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
• Polynomiality of infeasible-interior-point algorithms for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function

Cited In (10)

• Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
• 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 a wide neighborhood
• A full-Newton step infeasible interior-point method for linear optimization based on an exponential kernel function
• A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions

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

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