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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.sciencedirect.com/science/article/pii/S0096300314012697#
Description	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 rate of 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 beams in mutual contact with orthotropic Tresca and Coulomb friction discretized by up to one and half million nodal variables. 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 rate of 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 beams in mutual contact with orthotropic Tresca and Coulomb friction discretized by up to one and half million nodal variables. (en)
Title	On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (en)
skos:prefLabel	On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (en)
skos:notation	RIV/61989100:27740/14:86092160!RIV15-MSM-27740___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(ED1.1.00/02.0070), Z(MSM6198910027)
http://linked.open...iv/cisloPeriodika	2014/11/15
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Dostál, Zdeněk Kozubek, Tomáš Bouchala, Jiří Pospíšil, Lukáš
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / IT4Innovations
http://linked.open...dnocenehoVysledku	34517
http://linked.open...ai/riv/idVysledku	RIV/61989100:27740/14:86092160
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	orthotropic friction; rate of convergence; precision control; elliptic constraints; QPQC with separable constraints (en)
http://linked.open.../riv/klicoveSlovo	QPQC with separable constraints orthotropic friction elliptic constraints precision control rate of convergence
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[91500E8DAFD8]
http://linked.open...i/riv/nazevZdroje	APPLIED MATHEMATICS AND COMPUTATION
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	IT4Innovations Centre of Excellence
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	247
http://linked.open...iv/tvurceVysledku	Dostál, Zdeněk Kozubek, Tomáš Bouchala, Jiří Pospíšil, Lukáš Vodstrčil, Petr
http://linked.open...ain/vavai/riv/wos	000344474800074
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
issn	0096-3003
number of pages	17 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.amc.2014.09.044
http://localhost/t...ganizacniJednotka	27740

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 91 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software