Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-012-0180-9 / rank
Normal rank
 
Property / review text
 
The authors consider interior-point algorithms for semi-definite programming and symmetric conic programming problems. They apply a differential geometric framework, the so-called information geometry, to these classes of problems and show relationships between complexity analysis and the curvature integral taken along the central path.
Property / review text: The authors consider interior-point algorithms for semi-definite programming and symmetric conic programming problems. They apply a differential geometric framework, the so-called information geometry, to these classes of problems and show relationships between complexity analysis and the curvature integral taken along the central path. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jan-Joachim Rückmann / 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: 90C22 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6206956 / rank
 
Normal rank
Property / zbMATH Keywords
 
interior-point methods
Property / zbMATH Keywords: interior-point methods / rank
 
Normal rank
Property / zbMATH Keywords
 
iteration complexities
Property / zbMATH Keywords: iteration complexities / rank
 
Normal rank
Property / zbMATH Keywords
 
curvature integral
Property / zbMATH Keywords: curvature integral / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite programs
Property / zbMATH Keywords: semidefinite programs / rank
 
Normal rank
Property / zbMATH Keywords
 
symmetric cone programs
Property / zbMATH Keywords: symmetric cone programs / rank
 
Normal rank
Property / zbMATH Keywords
 
conic programming
Property / zbMATH Keywords: conic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
information geometry
Property / zbMATH Keywords: information geometry / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-012-0180-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060681267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvature integrals and iteration complexities in SDP and symmetric cone programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of following the central path of linear programs by linear extrapolation. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dualistic differential geometry of positive definite matrices and its applications to related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point method whose running time depends only on the constraint matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a commutative class of search directions for linear programming over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of primal-dual interior point algorithms to symmetric cones / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-012-0180-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
scientific article

    Statements

    Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2013
    0 references
    The authors consider interior-point algorithms for semi-definite programming and symmetric conic programming problems. They apply a differential geometric framework, the so-called information geometry, to these classes of problems and show relationships between complexity analysis and the curvature integral taken along the central path.
    0 references
    interior-point methods
    0 references
    iteration complexities
    0 references
    curvature integral
    0 references
    semidefinite programs
    0 references
    symmetric cone programs
    0 references
    conic programming
    0 references
    information geometry
    0 references

    Identifiers