Interior point methods for self-dual linear optimization problems based on kernel functions

zbMATH Open1194.90117MaRDI QIDQ3565724FDOQ3565724

Authors: M. El Ghami, Trond Steihaug 

Publication date: 7 June 2010

Recommendations

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Numerical results of primal-dual interior-point algorithms for semidefinite optimization based on kernel functions
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• An efficient parameterized logarithmic kernel function for linear optimization
• An eligible kernel based primal-dual interior-point method for linear optimization

zbMATH Keywords

large-updateiteration number

Mathematics Subject Classification ID

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

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Interior point methods for self-dual linear optimization problems based on kernel functions

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