No label defined (Q3783442)

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 4046981
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4046981

      Statements

      0 references
      1986
      0 references
      strategies for constraint deletion
      0 references
      quadratic programming algorithm
      0 references
      numerical example
      0 references
      Active-set feasible point methods
      0 references
      linearly constrained optimization problem
      0 references
      [For the entire collection see Zbl 0637.00009.] Active-set feasible point methods are widely used for solving the linearly constrained optimization problem: minimize f(x) subject to C Tx\(\geq b\), where f(x) is a sufficiently smooth and, in general, nonlinear function of the n-vector x, C T is an \(m\times n\) matrix, b is an m- vector. We give strategies for simultaneously dropping more than one constraint from the active set A which ensure that the step taken after the constraints are dropped does not violate any of the constraints in A. We also consider the criterion for choosing a particular constraint to drop when there are several possibilities from which to choose.
      0 references

      Identifiers