Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q163016
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Kojima, Masakazu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual potential reduction method for problems involving matrix inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of interior-point algorithms for degenerate monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / 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: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01581723 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003324738 / rank
 
Normal rank

Latest revision as of 08:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
scientific article

    Statements

    Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (English)
    0 references
    0 references
    0 references
    0 references
    11 March 1998
    0 references
    infeasible-interior-point method
    0 references
    predictor-corrector-method
    0 references
    primal-dual nondegeneracy
    0 references
    semidefinite program
    0 references
    superlinear convergence
    0 references
    0 references
    0 references

    Identifiers