About: Preconditioning for bound constrained quadratic programming problems arising from discretization of variational inequalities     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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í. (cs)
  • 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 preconditioning of 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 results of numerical
  • 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 preconditioning of 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 results of numerical (en)
Title
  • Preconditioning for bound constrained quadratic programming problems arising from discretization of variational inequalities
  • Preconditioning for bound constrained quadratic programming problems arising from discretization of variational inequalities (en)
  • Předpodmínění úloh kvadratického programování (cs)
skos:prefLabel
  • Preconditioning for bound constrained quadratic programming problems arising from discretization of variational inequalities
  • Preconditioning for bound constrained quadratic programming problems arising from discretization of variational inequalities (en)
  • Předpodmínění úloh kvadratického programování (cs)
skos:notation
  • RIV/61989100:27240/07:00014979!RIV08-AV0-27240___
http://linked.open.../vavai/riv/strany
  • 22-22
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET400300415), P(GA201/07/0294), Z(MSM6198910027)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 443519
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/07:00014979
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • quadratic programming; rate of convergence; bound constraints (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [0B01E55CB5D9]
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...i/riv/nazevZdroje
  • Computation Methods with Applications
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dostál, Zdeněk
  • Domorádová, Marta
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Ústav informatiky AV ČR
https://schema.org/isbn
  • 978-80-87136-00-3
http://localhost/t...ganizacniJednotka
  • 27240
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software