Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (Q3465241): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161361710 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.1857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic Polynomials and Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Problems over Positive Pseudopolynomial Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic Polynomials and Interior Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map <i>X</i>1/2<i>SX</i>1/2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Convergence in a Primal-Dual Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear convergence of interior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic programs, and their derivative relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:13, 11 July 2024

scientific article
Language Label Description Also known as
English
Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
scientific article

    Statements

    Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (English)
    0 references
    21 January 2016
    0 references
    conic optimization problem
    0 references
    worst-case complexity analysis
    0 references
    self-concordant barriers
    0 references
    polynomial-time methods
    0 references
    predictor-corrector methods
    0 references
    local superlinear convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references