Minimizing quadratic functions with separable quadratic constraints

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27600%2F07%3A10223883" target="_blank" >RIV/61989100:27600/07:10223883 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Minimizing quadratic functions with separable quadratic constraints
Original language description
This paper deals with minimizing quadratic functions with a special form of quadratic constraints arising in 3D contact problems of linear elasticity with isotropic friction. The proposed algorithm combines the acive-set method with the conjugate gradient method. Its general scheme is similar to algorithms of the Polyak?s type that solve the quadratic programming problems with simple bounds. Since the algorithm does not terminate in a finite number of steps, the convergence is proved. The implementationuses an adaptive precision control of the conjugate gradient loops. Numerical experiments demonstrate the computational efficiency of the method.
Czech name
—
Czech description
—

Project
<a href="/en/project/1ET400300415" target="_blank" >1ET400300415: Modelling and simulation of complex technical problems:effective numerical algorithms and parallel implementation using new information technologie</a>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP) Z - Vyzkumny zamer (s odkazem do CEZ) S - Specificky vyzkum na vysokych skolach

Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)