Projector preconditioning for partially bound-constrained quadratic optimization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F07%3A10224348" target="_blank" >RIV/61989100:27240/07:10224348 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/nla.555" target="_blank" >http://dx.doi.org/10.1002/nla.555</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/nla.555" target="_blank" >10.1002/nla.555</a>

Result language
angličtina
Original language name
Projector preconditioning for partially bound-constrained quadratic optimization
Original language description
Preconditioning by a conjugate projector is combined with the recently proposed modified proportioning with reduced gradient projection (MPRGP) algorithm for the solution of bound-constrained quadratic programming problems. If applied to the partially bound-constrained problems, such as those arising from the application of FETI-based domain decomposition methods to the discretized elliptic boundary variational inequalities, the resulting algorithm is shown to have better bound on the rate of convergence than the original MPRGP algorithm. The performance of the algorithm is illustrated on the solution of a model boundary variational inequality.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>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)