On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86092160" target="_blank" >RIV/61989100:27240/14:86092160 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/14:86092160

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0096300314012697#" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0096300314012697#</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature

Popis výsledku v původním jazyce

The paper deals with an effective implementation of some algorithms for the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature. Here we discuss robust quantitative refinement of the Karush-Kuhn-Tucker conditions, extend existing results on the decrease of the cost function along the projected gradient path to separable constraints with elliptic components, and plug them into the existing algorithms for the solution of the QPQC problems with R-linear rateof convergence in the bounds on the spectrum. The results are then extended to the problems with separable inequality and linear equality constraints. The performance of the algorithms is demonstrated on the solution of a problem of two cantilever beamsin mutual contact with orthotropic Tresca and Coulomb friction discretized by up to one and half million nodal variables.

Název v anglickém jazyce

On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature

Popis výsledku anglicky

The paper deals with an effective implementation of some algorithms for the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature. Here we discuss robust quantitative refinement of the Karush-Kuhn-Tucker conditions, extend existing results on the decrease of the cost function along the projected gradient path to separable constraints with elliptic components, and plug them into the existing algorithms for the solution of the QPQC problems with R-linear rateof convergence in the bounds on the spectrum. The results are then extended to the problems with separable inequality and linear equality constraints. The performance of the algorithms is demonstrated on the solution of a problem of two cantilever beamsin mutual contact with orthotropic Tresca and Coulomb friction discretized by up to one and half million nodal variables.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

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>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2014

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

APPLIED MATHEMATICS AND COMPUTATION

ISSN

0096-3003

e-ISSN

—

Svazek periodika

247

Číslo periodika v rámci svazku

2014/11/15

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

17

Strana od-do

848-864

Kód UT WoS článku

000344474800074

EID výsledku v databázi Scopus

—