A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/02331930008844515 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039096676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Step Interior Point Algorithms for Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy Continuation Methods for Nonlinear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new continuation method for complementarity problems with uniform P- functions / 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: On Q-order and R-order of convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global linear convergence of a path-following algorithm for some monotone variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Path-Following Method for Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming / 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: Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-dual affine scaling algorithm with necessary centering as a safeguard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path following algorithm for a class of convex programming problems / rank
 
Normal rank

Latest revision as of 15:07, 3 June 2024

scientific article
Language Label Description Also known as
English
A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup>
scientific article

    Statements

    A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2001
    0 references
    interior point algorithms
    0 references
    nonlinear monotone complementarity problems
    0 references
    polynomial complexity
    0 references
    0 references

    Identifiers