Box constrained quadratic programming with controlled precision of auxiliary problems and applications

dc.contributor.authorDostál, Zdeněk
dc.date.accessioned2007-09-17T12:36:26Z
dc.date.available2007-09-17T12:36:26Z
dc.date.issued1996
dc.description.abstract-enWe review our recent results on the solution of quadratic programming problems with simple bounds by means of the conjugate gradient method with inexact solution of auxiliary subproblems and projections. Precision of the solution of auxiliary problems is controlled by the product of a positive constant Gamma with the norm of violation of the Kuhn-Tucker contact conditions. The resulting algorithm converges for any positive Gamma and reaches the solution in a finite number of steps provided the problem is nondegenerate. A lower bound on Gamma is given so that the finite termination property is preserved even for degenerate problems. The algorithm may be implemented with projections so that it can drop and add many constraints whenever the active set is changed. Applications to the solution of inner obstacle problems and contact problems of elasticity are reported.en
dc.identifier.citationZeitschrift für angewandte Mathematik und Mechanik. 1996, vol. 76, suppl. 3, p.413-414.en
dc.identifier.issn0044-2267
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.urihttp://hdl.handle.net/10084/62779
dc.identifier.wosA1996VR47500117
dc.language.isoenen
dc.publisherAkademie-Verlagen
dc.relation.ispartofseriesZeitschrift für angewandte Mathematik und Mechaniken
dc.titleBox constrained quadratic programming with controlled precision of auxiliary problems and applicationsen
dc.typearticleen

Files