A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Hong-Wei Liu / rank
 
Normal rank
Property / review text
 
This article presents a strategy for the complexity analysis of an infeasible interior-point method for general symmetric cone programming problems. The paper begins with an overview of symmetric cone programming and the associated literature, before introducing the key features of Euclidean Jordan algebras. The authors then present the main results of infeasible interior-point methods and their proposed algorithmic framework for complexity analysis based on Euclidean Jordan algebras. The fourth section of this article analyzes the proposed algorithm and establishes its key properties and convergence. The article concludes with a list of useful references.
Property / review text: This article presents a strategy for the complexity analysis of an infeasible interior-point method for general symmetric cone programming problems. The paper begins with an overview of symmetric cone programming and the associated literature, before introducing the key features of Euclidean Jordan algebras. The authors then present the main results of infeasible interior-point methods and their proposed algorithmic framework for complexity analysis based on Euclidean Jordan algebras. The fourth section of this article analyzes the proposed algorithm and establishes its key properties and convergence. The article concludes with a list of useful references. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Efstratios Rappos / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C51 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6480816 / rank
 
Normal rank
Property / zbMATH Keywords
 
Jordan algebra
Property / zbMATH Keywords: Jordan algebra / rank
 
Normal rank
Property / zbMATH Keywords
 
symmetric cone programming
Property / zbMATH Keywords: symmetric cone programming / rank
 
Normal rank
Property / zbMATH Keywords
 
infeasible-interior-point method
Property / zbMATH Keywords: infeasible-interior-point method / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial complexity
Property / zbMATH Keywords: polynomial complexity / rank
 
Normal rank

Revision as of 22:16, 30 June 2023

scientific article
Language Label Description Also known as
English
A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
scientific article

    Statements

    A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references
    This article presents a strategy for the complexity analysis of an infeasible interior-point method for general symmetric cone programming problems. The paper begins with an overview of symmetric cone programming and the associated literature, before introducing the key features of Euclidean Jordan algebras. The authors then present the main results of infeasible interior-point methods and their proposed algorithmic framework for complexity analysis based on Euclidean Jordan algebras. The fourth section of this article analyzes the proposed algorithm and establishes its key properties and convergence. The article concludes with a list of useful references.
    0 references
    Jordan algebra
    0 references
    symmetric cone programming
    0 references
    infeasible-interior-point method
    0 references
    polynomial complexity
    0 references

    Identifiers