Atmtract--We present an algorithm for finding the global minimum of an indefinite quadratic function over the integers contained in a compact, convex set. To find this minJmmn, the algorithm first transforms the problem into an equivalent problem with a separable objective function. It then uses a b
An algorithm for quadratic programming
โ Scribed by Marguerite Frank; Philip Wolfe
- Publisher
- John Wiley and Sons
- Year
- 1956
- Tongue
- English
- Weight
- 744 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
โฆ Synopsis
Pr in c e t o n Un i v e r s i t y
A finite iteration method for calculating the solution of quadratic Extensions to m o r e general nonprogramming problems is described.r linear Droblems a r e suggested.
๐ SIMILAR VOLUMES
In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.
The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems