Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58028366 / 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-010-9746-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047812005 / 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 / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyticity of weighted central paths and error bounds for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5848416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the central path for a special class of degenerate SDP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for sufficient linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting behaviour and analyticity of weighted central paths in semidefinite programming / 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: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence / 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: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / 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: 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: Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path / 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: A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction / 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: Quadratic Convergence in a Primal-Dual Method / 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: Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming / 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: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path / 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: A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists / 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: Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup> / 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: A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming / 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

Latest revision as of 21:18, 3 July 2024

scientific article
Language Label Description Also known as
English
Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
scientific article

    Statements

    Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (English)
    0 references
    0 references
    10 March 2011
    0 references
    This article studies off-central paths, corresponding to the Nesterov-Todd (NT) direction for the solution of the semidefinite linear complementarity problem. The article begins with a literature overview covering prior work on interior methods, central paths, convergence and the properties of semidefinite programs and monotone semidefinite linear complementarity problems. The second section contains the main definitions and the background assumptions required for this problem. This is followed by the main section of the paper, where the asymptotic behavior of NT paths are studied. Several important theorems are presented in this section with proof, including the necessary and sufficient conditions for when such a path is analytic with respect to \(\mu\) and \(\sqrt\mu\). The paper concludes with a list of relevant articles.
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite linear complementarity problem
    0 references
    interior point methods
    0 references
    NT direction
    0 references
    local convergence
    0 references
    ordinary differential equations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references