The accuracy of interior-point methods based on kernel functions
type: Item
instance of: scholarly article
title: The accuracy of interior-point methods based on kernel functions
zbMATH Open document ID: 1257.90110
author: Manuel V. C. Vieira
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-14T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6136274
zbMATH Keywords: linear optimization
zbMATH Keywords: interior-point methods
zbMATH Keywords: kernel functions
MaRDI profile type: Publication
full work available at URL: s10957-012-0071-0
OpenAlex ID: W1983123287
cites work: A new and efficient large-update interior-point method for linear optimization
cites work: A new class of polynomial primal-dual methods for linear and semidefinite optimization
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: Q4791754
cites work: A primal‐dual interior-point method for linear optimization based on a new proximity function
cites work: A polynomial-time algorithm for linear optimization based on a new simple kernel function
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: Q5453751
cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
cites work: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
cites work: Conic convex programming and self-dual embedding
cites work: Q4347846
cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
cites work: A polynomial-time algorithm for linear optimization based on a new class of kernel functions
cites work: Generic Primal-dual Interior Point Methods Based on a New Kernel Function
cites work: A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
cites work: AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
DOI: 10.1007/S10957-012-0071-0
description: scientific article; zbMATH DE number 6136274