A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5073769
Language Label Description Also known as
default for all languages
No label defined
    English
    A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
    scientific article; zbMATH DE number 5073769

      Statements

      A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (English)
      0 references
      0 references
      0 references
      0 references
      17 November 2006
      0 references
      smoothing Newton method
      0 references
      global convergence
      0 references
      superlinear convergence
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers