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.
An equivalence between two algorithms for quadratic programming
โ Scribed by Jong-Shi Pang
- Publisher
- Springer-Verlag
- Year
- 1981
- Tongue
- English
- Weight
- 634 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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