A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
type: Item
instance of: scholarly article
title: A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
zbMATH Open document ID: 1408.90319
author: Yanyan Li
published in: Operations Research Letters
publication date: 2018-10-02T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6946086
zbMATH Keywords: proximity function
zbMATH Keywords: semidefinite optimization
zbMATH Keywords: interior-point methods
zbMATH Keywords: large-update methods
MaRDI profile type: Publication
full work available at URL: j.orl.2016.02.013
OpenAlex ID: W2291535362
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
cites work: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
cites work: A new polynomial-time algorithm for linear programming
cites work: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
cites work: Interior-point algorithm for linear optimization based on a new trigonometric kernel function
cites work: Q4206561
cites work: Q4324980
cites work: Q4791754
cites work: AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
cites work: Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
cites work: Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
cites work: Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
cites work: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
DOI: 10.1016/J.ORL.2016.02.013
description: scientific article; zbMATH DE number 6946086