Our problem of interest consists of minimizing a separable, convex and differentiable
function over a convex set, defined by bounds on the variables and an explicit constraint …

Practical quasi-Newton methods for solving nonlinear systems are surveyed. The definition
of quasi-Newton methods that includes Newton's method as a particular case is adopted …

We present an algorithm which combines standard active set strategies with the gradient
projection method for the solution of quadratic programming problems subject to bounds …

There are many applications related to singly linearly constrained quadratic programs
subjected to upper and lower bounds. In this paper, a new algorithm based on secant …

This paper gives an O (n) algorithm for a singly constrained convex quadratic program using
binary search to solve the Kuhn-Tucker system. Computational results indicate that a …

A novel approach to speaker identification is presented. The technique, based on Vapnik's
(1995) work with support vectors, is exciting for several reasons. The support vector method …

In this paper we study the nonlinear resource allocation problem, defined as the
minimization of a convex function over one convex constraint and bounded integer …

Patriksson (2008) provided a then up-to-date survey on the continuous, separable,
differentiable and convex resource allocation problem with a single resource constraint …

Breakpoint searching algorithms for the continuous quadratic knapsack problem Page 1 Math.
Program., Ser. A (2008) 112:473–491 DOI 10.1007/s10107-006-0050-z FULL LENGTH PAPER …

We consider the problem of minimizing a quadratic function with a knapsack constraint.
Quadratic knapsack problems have numerous applications, including the least distance …