Preconditioning for Bound Constrained Quadratic Programming Problems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F08%3A00021142" target="_blank" >RIV/61989100:27240/08:00021142 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Preconditioning for Bound Constrained Quadratic Programming Problems

Original language description

Recently proposed MPRGP algorithm for the solution of strictly convex quadratic programming problems was proved to enjoy R-linear convergence in bounds on the spectrum. In this talk we consider two methods of preconditioning that improved the theoreticalrate of convergence including nonlinear steps, namely preconditioning by a conjugate projector and edge averaging for the variational inequalities discretized by FETI-DP domain decomposition. Theoretical results are confirmed by numerical experiments.

Czech name

—

Czech description

—

Type

M - Conference organization

CEP classification

BA - General mathematics

OECD FORD branch

—

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><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2008

Confidentiality

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

Event location

Boston, USA

Event country

US - UNITED STATES

Event starting date

—

Event ending date

—

Total number of attendees

300

Foreign attendee count

300

Type of event by attendee nationality

WRD - Celosvětová akce