Show simple item record

dc.contributor.authorKučera, Radek
dc.date.accessioned2007-07-20T08:31:39Z
dc.date.available2007-07-20T08:31:39Z
dc.date.issued2007
dc.identifier.citationOptimization methods and software. 2007, vol. 22, issue 3, p. 453-467.en
dc.identifier.issn1055-6788
dc.identifier.issn1029-4937
dc.identifier.urihttp://hdl.handle.net/10084/61012
dc.language.isoenen
dc.publisherTaylor & Francisen
dc.relation.ispartofseriesOptimization methods and softwareen
dc.relation.urihttp://dx.doi.org/10.1080/10556780600609246en
dc.subjectquadratic functionen
dc.subjectseparable quadratic constraintsen
dc.subjectactive seten
dc.subjectconvergenceen
dc.subjectconjugate gradient methoden
dc.subjectadaptive precision controlen
dc.titleMinimizing quadratic functions with separable quadratic constraintsen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.description.abstract-enThis article deals with minimizing quadratic functions with a special form of quadratic constraints that arise in 3D contact problems of linear elasticity with isotropic friction [Haslinger, J., Kučera, R. and Dostál, Z., 2004, An algorithm for the numerical realization of 3D contact problems with Coulomb friction. Journal of Computational and Applied Mathematics, 164/165, 387-408.]. The proposed algorithm combines the active set method with the conjugate gradient method. Its general scheme is similar to the algorithms of Polyak's type that solve the quadratic programming problems with simple bounds. As the algorithm does not terminate in a finite number of steps, the convergence is proved. The implementation uses an adaptive precision control of the conjugate gradient loops. Numerical experiments demonstrate the computational efficiency of the method.en
dc.identifier.doi10.1080/10556780600609246
dc.identifier.wos000246622500005


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record