Numerical Experience with Iterative Methods for Equality Constrained Nonlinear Programming Problems.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F01%3A06010142" target="_blank" >RIV/67985807:_____/01:06010142 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Numerical Experience with Iterative Methods for Equality Constrained Nonlinear Programming Problems.
Original language description
We show that indefinitely preconditioned symmetric Krylov-subspace methods are very efficient for solving linearized KKT systems arising in equality constrained optimization. We give a numerical comparison of various Krylov subspace methods in three different forms (original system, null-space transformation, range-space transformation). Furthermore, we give a survey of our previous results concerning indefinite preconditioners and merit functions and prove new propositions.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F00%2F0080" target="_blank" >GA201/00/0080: Development of methods for solving problems of non-smooth and non-linear analysis</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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
Name of the periodical
Optimization Methods and Software
ISSN
1055-6788
e-ISSN
—
Volume of the periodical
16
Issue of the periodical within the volume
1-4
Country of publishing house
US - UNITED STATES
Number of pages
31
Pages from-to
257-287
UT code for WoS article
—
EID of the result in the Scopus database
—