The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10240009" target="_blank" >RIV/61989100:27240/18:10240009 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/18:10240009

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0378475417303415" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0378475417303415</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.matcom.2017.10.003" target="_blank" >10.1016/j.matcom.2017.10.003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints

Popis výsledku v původním jazyce

A variant of the projected Barzilai-Borwein method for solving the strictly convex QCQP problems with separable constraints is presented. The convergence is enforced by a combination of the fall-back strategy and the fixed step- length gradient projection. Using the recent results on the decrease of the convex quadratic function along the projected- gradient path, we prove that the algorithm enjoys the R-linear convergence. The algorithm is plugged into our scalable TFETI based domain decomposition algorithm for the solution of contact problems and its performance is demonstrated on the solution of contact problems, including a frictionless problem and the problems with the isotropic and orthotropic Tresca friction.

Název v anglickém jazyce

The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints

Popis výsledku anglicky

A variant of the projected Barzilai-Borwein method for solving the strictly convex QCQP problems with separable constraints is presented. The convergence is enforced by a combination of the fall-back strategy and the fixed step- length gradient projection. Using the recent results on the decrease of the convex quadratic function along the projected- gradient path, we prove that the algorithm enjoys the R-linear convergence. The algorithm is plugged into our scalable TFETI based domain decomposition algorithm for the solution of contact problems and its performance is demonstrated on the solution of contact problems, including a frictionless problem and the problems with the isotropic and orthotropic Tresca friction.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název periodika

Mathematics and computers in simulation

ISSN

0378-4754

e-ISSN

—

Svazek periodika

145

Číslo periodika v rámci svazku

March 2018

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

79-89

Kód UT WoS článku

000416128600007

EID výsledku v databázi Scopus

—