About: An optimal algorithm for minimization of quadratic functions with bounded spectrum subject to separable convex inequality and linear equality constraints

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

About: An optimal algorithm for minimization of quadratic functions with bounded spectrum subject to separable convex inequality and linear equality constraints 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
Description	An, in a sense, optimal algorithm for minimization of quadratic functions subject to separable convex inequality and linear equality constraints is presented. Its unique feature is an error bound in terms of bounds on the spectrum of the Hessian of the cost function. If applied to a class of problems with the spectrum of the Hessians in a given positive interval, the algorithm can find approximate solutions in a uniformly bounded number of simple iterations, such as matrix-vector multiplications. Moreover, if the class of problems admits a sparse representation of the Hessian, it simply follows that the cost of the solution is proportional to the number of unknowns. Theoretical results are illustrated by numerical experiments. An, in a sense, optimal algorithm for minimization of quadratic functions subject to separable convex inequality and linear equality constraints is presented. Its unique feature is an error bound in terms of bounds on the spectrum of the Hessian of the cost function. If applied to a class of problems with the spectrum of the Hessians in a given positive interval, the algorithm can find approximate solutions in a uniformly bounded number of simple iterations, such as matrix-vector multiplications. Moreover, if the class of problems admits a sparse representation of the Hessian, it simply follows that the cost of the solution is proportional to the number of unknowns. Theoretical results are illustrated by numerical experiments. (en)
Title	An optimal algorithm for minimization of quadratic functions with bounded spectrum subject to separable convex inequality and linear equality constraints An optimal algorithm for minimization of quadratic functions with bounded spectrum subject to separable convex inequality and linear equality constraints (en)
skos:prefLabel	An optimal algorithm for minimization of quadratic functions with bounded spectrum subject to separable convex inequality and linear equality constraints An optimal algorithm for minimization of quadratic functions with bounded spectrum subject to separable convex inequality and linear equality constraints (en)
skos:notation	RIV/61989100:27600/10:86075327!RIV13-GA0-27600___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA201/07/0294), Z(MSM6198910027)
http://linked.open...iv/cisloPeriodika	6
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Kučera, Radek
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 / Katedra matematiky a deskriptivní geometrie
http://linked.open...dnocenehoVysledku	246264
http://linked.open...ai/riv/idVysledku	RIV/61989100:27600/10:86075327
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	optimality; convergence rate; gradient projections; augmented Lagrangian; active set; separable convex constraints; quadratic function (en)
http://linked.open.../riv/klicoveSlovo	convergence rate active set quadratic function augmented Lagrangian gradient projections optimality separable convex constraints
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[0B0089C1C753]
http://linked.open...i/riv/nazevZdroje	SIAM journal on optimization
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Qualitative analysis of contact problems with friction and asymptotically optimal algorithms for their solution
http://linked.open...UplatneniVysledku	2010
http://linked.open...v/svazekPeriodika	20
http://linked.open...iv/tvurceVysledku	Dostál, Zdeněk Kučera, Radek
http://linked.open...ain/vavai/riv/wos	000285547100008
http://linked.open...n/vavai/riv/zamer	Výpočetně náročné počítačové simulace a optimalizace
issn	1052-6234
number of pages	26 (xsd:int)
http://localhost/t...ganizacniJednotka	27600

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