Choosing optimal expansion step-length of MPRGP algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F19%3A00520857" target="_blank" >RIV/68145535:_____/19:00520857 - isvavai.cz</a>
Result on the web
<a href="https://www.ctresources.info/ccp/paper.html?id=9285" target="_blank" >https://www.ctresources.info/ccp/paper.html?id=9285</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4203/ccp.112.18" target="_blank" >10.4203/ccp.112.18</a>
Alternative languages
Result language
angličtina
Original language name
Choosing optimal expansion step-length of MPRGP algorithm
Original language description
This paper deals with optimal expansion step-length for the active set based MPRGP algorithm. The theory says that the fixed step-length should be less than reciprocal Hessian norm multiplied by two. This step-length is often too short and results in a large number of expansion steps. Numerical experiments demonstrate the exploitation of the step-length prolongation beyond this interval on three quadratic programming problems -- membrane contact problem solved in the primal formulation, contact problem of linear elasticity solved by TFETI and machine learning problems of SVM type, all implemented in the PERMON toolbox.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
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
2019
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
Proceedings of the Sixth International Conference on Parallel, Distributed, GPU and Cloud Computing for Engineering
ISBN
—
ISSN
1759-3433
e-ISSN
—
Number of pages
15
Pages from-to
18
Publisher name
Civil-Comp Press
Place of publication
Stirlingshire
Event location
Pecs
Event date
Jun 4, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—