Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58028375, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinary differential equations. An introduction to nonlinear analysis. Transl. from the German by Gerhard Metzen / 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: Q5574850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Notion of Weighted Centers for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting behavior of weighted central paths in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyticity of the central path at the boundary point in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3231543 / 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: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / 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: Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified layered-step interior-point algorithm for linear 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: Properties of an Interior-Point Mapping for Mixed Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems / 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: Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348700 / 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: 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: Asymptotic Behavior of Continuous Trajectories for Primal-Dual Potential-Reduction Methods / 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: 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
Property / cites work
 
Property / cites work: On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming / 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: On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The curvature integral and the complexity of linear complementarity problems / rank
 
Normal rank

Latest revision as of 01:37, 3 July 2024

scientific article
Language Label Description Also known as
English
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
scientific article

    Statements

    Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (English)
    0 references
    0 references
    0 references
    21 July 2010
    0 references
    0 references
    ordinary differential equations
    0 references
    off-central paths
    0 references
    analytic curve
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references