All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Preconditioning for bound constrained quadratic programming problems arising from discretization of variational inequalities

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F07%3A00014979" target="_blank" >RIV/61989100:27240/07:00014979 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Preconditioning for bound constrained quadratic programming problems arising from discretization of variational inequalities

  • Original language description

    The active set based MPRGP (modified proportioning with reduced gradient projection) for the solution of partially bound constrained quadratic programming problems turned out to be an important ingredient in development of scalable algorithms for the solution of variational inequalities by FETI and BETI domain decomposition methods. The algorithm was proved to have R-linear rate of convergence in terms of the spectral condition number of the Hessian matrix. Our presentation considers the preconditioningof MPRGP active set based algorithm with goal to get improved rate of convergence of the algorithm. We are interested in results which concern the overall rate of convergence, which requires not only the preconditioning of the solution of auxiliary linear solvers, but also the preconditioning of nonlinear steps. We first report improved bounds on the rate of convergence of MPRGP with preconditioning by conjugate projector applied to a model boundary variational inequality and give resul

  • Czech name

    Předpodmínění úloh kvadratického programování

  • Czech description

    V prezentaci ukazujeme předpodmínění algoritmu MPRGP s cílem zlepšit rychlost konvergence. Předpodmínění zasahuje všechny kroky algoritmu, tedy i ty nelineární.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • 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)

Others

  • Publication year

    2007

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Computation Methods with Applications

  • ISBN

    978-80-87136-00-3

  • ISSN

  • e-ISSN

  • Number of pages

    1

  • Pages from-to

    22-22

  • Publisher name

    Institute of Computer Science AS CR

  • Place of publication

    Praha

  • Event location

  • Event date

  • Type of event by nationality

  • UT code for WoS article