A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5564916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / 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: The Projective SUMT Method for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for 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: A new continuation method for complementarity problems with uniform P- functions / 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 polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality and inequality constrained optimization algorithms with convergent stepsizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions / 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: A Superlinearly Convergent Polynomial Primal-Dual Interior-Point 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
Property / cites work
 
Property / cites work: On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems / rank
 
Normal rank

Latest revision as of 14:00, 23 May 2024

scientific article; zbMATH DE number 766372
Language Label Description Also known as
English
A quadratically convergent scaling newton’s method for nonlinear complementarity problems
scientific article; zbMATH DE number 766372

    Statements

    A quadratically convergent scaling newton’s method for nonlinear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    21 June 1995
    0 references
    quadratic convergence
    0 references
    scaling Newton's method
    0 references
    nonlinear complementarity problems
    0 references
    0 references
    0 references

    Identifiers