Some Randomized Algorithms for Convex Quadratic Programming
β Scribed by R. Goldbach
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 271 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0095-4616
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an e
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