{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:03:59Z","timestamp":1700093039942},"reference-count":24,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T00:00:00Z","timestamp":1193184000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Linear Algebra App"],"published-print":{"date-parts":[[2007,12]]},"abstract":"Abstract<\/jats:title>This work is concerned with the convergence properties and the numerical analysis of the preconditioned conjugate gradient (PCG) method applied to the solution of indefinite linear systems arising in nonlinear optimization. Our approach is based on the choice of quasidefinite preconditioners and of a suitable factorization routine. Some theoretical and numerical results about these preconditioners are obtained. Furthermore, we show the behaviour of the PCG method for different formulations of the indefinite system and we compare the effectiveness of the proposed variants. Copyright \u00a9 2007 John Wiley & Sons, Ltd.<\/jats:p>","DOI":"10.1002\/nla.558","type":"journal-article","created":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T11:43:47Z","timestamp":1193226227000},"page":"807-831","source":"Crossref","is-referenced-by-count":1,"title":["On the solution of indefinite systems arising in nonlinear programming problems"],"prefix":"10.1002","volume":"14","author":[{"given":"Silvia","family":"Bonettini","sequence":"first","affiliation":[]},{"given":"Valeria","family":"Ruggiero","sequence":"additional","affiliation":[]},{"given":"Federica","family":"Tinti","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,10,24]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0560-5"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008677427361"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000026882.34332.1b"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011391"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0090900"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1506(199805\/06)5:3<219::AID-NLA134>3.0.CO;2-7"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/nla.354"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/nla.308"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9035-y"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492904000212"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827598345667"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9012-5"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00433-7"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/0803023"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1137\/0613058"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582254"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/200979.201043"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9039-7"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805754"},{"key":"e_1_2_1_23_2","unstructured":"Luk\u0161anL Vl\u010dekJ.Sparse and partially separable test problems for unconstrained and equality constrained optimization. Technical Report 767 Institute of Computer Science Academy of Science of the Czech Republic 1999."},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1137\/0708060"},{"key":"e_1_2_1_25_2","unstructured":"DuffIS ReidJK.A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Technical Report AERE R10533 HMSO London 1982."}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnla.558","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T04:53:23Z","timestamp":1700024003000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nla.558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,24]]},"references-count":24,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1002\/nla.558"],"URL":"https:\/\/doi.org\/10.1002\/nla.558","archive":["Portico"],"relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,24]]}}}