Now showing items 1-2 of 2

    • Bound constrained quadratic programming via piecewise quadratic functions 

      Madsen, K.; Nielsen, H. B.; Pınar, M. Ç. (Springer-Verlag, 1999)
      We consider the strictly convex quadratic programming problem with bounded variables. A dual problem is derived using Lagrange duality. The dual problem is the minimization of an unconstrained, piecewise quadratic function. ...
    • A finite continuation algorithm for bound constrained quadratic programming 

      Madsen, K.; Nielsen, H. B.; Pınar, M. C. (Society for Industrial and Applied Mathematics Publications, 1998)
      The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear ℓ1 minimization problem with quadratic terms. A smooth approximation to the linear ℓ1 function is used to obtain a parametric ...