File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Solving a class of matrix minimization problems by linear variational inequality approaches

TitleSolving a class of matrix minimization problems by linear variational inequality approaches
Authors
Tao, MinYuan, Xiao MingHe, Bing Sheng
KeywordsProjection and contraction method
Matrix minimization
Issue Date2011
Citation
Linear Algebra and Its Applications, 2011, v. 434, n. 11, p. 2343-2352 How to Cite?
DOI: http://dx.doi.org/10.1016/j.laa.2010.11.041
AbstractA class of matrix optimization problems can be formulated as a linear variational inequalities with special structures. For solving such problems, the projection and contraction method (PC method) is extended to variational inequalities with matrix variables. Then the main costly computational load in PC method is to make a projection onto the semi-definite cone. Exploiting the special structures of the relevant variational inequalities, the Levenberg-Marquardt type projection and contraction method is advantageous. Preliminary numerical tests up to 1000×1000 matrices indicate that the suggested approach is promising. © 2011 Published by Elsevier Inc.
Persistent Identifierhttp://hdl.handle.net/10722/250967
ISSN
0024-3795
2023 Impact Factor: 1.0
2023 SCImago Journal Rankings: 0.837
ISI Accession Number ID
WOS:000289497700009

 

DC FieldValueLanguage
dc.contributor.authorTao, Min-
dc.contributor.authorYuan, Xiao Ming-
dc.contributor.authorHe, Bing Sheng-
dc.date.accessioned2018-02-01T01:54:12Z-
dc.date.available2018-02-01T01:54:12Z-
dc.date.issued2011-
dc.identifier.citationLinear Algebra and Its Applications, 2011, v. 434, n. 11, p. 2343-2352-
dc.identifier.issn0024-3795-
dc.identifier.urihttp://hdl.handle.net/10722/250967-
dc.description.abstractA class of matrix optimization problems can be formulated as a linear variational inequalities with special structures. For solving such problems, the projection and contraction method (PC method) is extended to variational inequalities with matrix variables. Then the main costly computational load in PC method is to make a projection onto the semi-definite cone. Exploiting the special structures of the relevant variational inequalities, the Levenberg-Marquardt type projection and contraction method is advantageous. Preliminary numerical tests up to 1000×1000 matrices indicate that the suggested approach is promising. © 2011 Published by Elsevier Inc.-
dc.languageeng-
dc.relation.ispartofLinear Algebra and Its Applications-
dc.subjectProjection and contraction method-
dc.subjectMatrix minimization-
dc.titleSolving a class of matrix minimization problems by linear variational inequality approaches-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.laa.2010.11.041-
dc.identifier.scopuseid_2-s2.0-79952624785-
dc.identifier.volume434-
dc.identifier.issue11-
dc.identifier.spage2343-
dc.identifier.epage2352-
dc.identifier.isiWOS:000289497700009-
dc.identifier.issnl0024-3795-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats