Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal‐dual interior-point method for linear optimization based on a new proximity function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nesterov--Todd Direction in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank

Revision as of 20:14, 1 July 2024

scientific article; zbMATH DE number 5584627
Language Label Description Also known as
English
Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
scientific article; zbMATH DE number 5584627

    Statements

    Identifiers