Convex quadratic programming with one constraint and bounded variables (Q3771973)

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 4031404
Language Label Description Also known as
default for all languages
No label defined
    English
    Convex quadratic programming with one constraint and bounded variables
    scientific article; zbMATH DE number 4031404

      Statements

      Convex quadratic programming with one constraint and bounded variables (English)
      0 references
      0 references
      0 references
      0 references
      1986
      0 references
      projection
      0 references
      separable program
      0 references
      convex quadratic problem
      0 references
      linear equality constraint
      0 references
      bounded variables
      0 references
      exact line search
      0 references
      unit step-size
      0 references
      An iterative algorithm is proposed to solve a convex quadratic problem with one linear equality constraint and bounded variables. At each iteration of the algorithm a separable convex quadratic problem with the same constraint set is solved. Two possibilities in choosing the step- size are analyzed, i.e. an exact line search and a unit step-size. The first approach requires fewer iterations in general, but more computation at each one. Some numerical testing results are included. Besides other results they show that the second approach requires less execution time.
      0 references

      Identifiers