A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints (Q2432613)

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 5067427
Language Label Description Also known as
default for all languages
No label defined
    English
    A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
    scientific article; zbMATH DE number 5067427

      Statements

      A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints (English)
      0 references
      0 references
      0 references
      0 references
      25 October 2006
      0 references

      Identifiers