Vote for your favorite mineral in #MinCup25! - Kosmochlor vs. Azurite
It's a battle of green vs blue as rare but vibrant chromium-bearing kosmochlor up against the deep blue copper alteration mineral azurite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Zheng, Hua, Li, Wen (2015) The modulus-based nonsmooth Newton’s method for solving linear complementarity problems. Journal of Computational and Applied Mathematics, 288. 116-126 doi:10.1016/j.cam.2015.04.006

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleThe modulus-based nonsmooth Newton’s method for solving linear complementarity problems
JournalJournal of Computational and Applied Mathematics
AuthorsZheng, HuaAuthor
Li, WenAuthor
Year2015 (November)Volume288
PublisherElsevier BV
DOIdoi:10.1016/j.cam.2015.04.006Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID9499400Long-form Identifiermindat:1:5:9499400:3
GUID0
Full ReferenceZheng, Hua, Li, Wen (2015) The modulus-based nonsmooth Newton’s method for solving linear complementarity problems. Journal of Computational and Applied Mathematics, 288. 116-126 doi:10.1016/j.cam.2015.04.006
Plain TextZheng, Hua, Li, Wen (2015) The modulus-based nonsmooth Newton’s method for solving linear complementarity problems. Journal of Computational and Applied Mathematics, 288. 116-126 doi:10.1016/j.cam.2015.04.006
In(n.d.) Journal of Computational and Applied Mathematics Vol. 288. Elsevier BV

See Also

These are possibly similar items as determined by title/reference text matching only.

Guo, Wenxiu, Li, Jianqing, Li, Yongyao, Lu, Xiaoping, Zheng, Hua (2025) A modulus-based inner–outer iteration method for nonlinear complementarity problems. Journal of Computational and Applied Mathematics, 463. doi:10.1016/j.cam.2025.116489
Li, Dong-Kai, Wang, Li, Liu, Yu-Ying (2022) A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems. Journal of Computational and Applied Mathematics, 409. 114140pp. doi:10.1016/j.cam.2022.114140
Zheng, Hua, Li, Wen, Vong, Seakweng (2020) An iteration method for nonlinear complementarity problems. Journal of Computational and Applied Mathematics, 372. 112681pp. doi:10.1016/j.cam.2019.112681
Huang, Zhengge, Cui, Jingjing (2023) The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems. Journal of Computational and Applied Mathematics, 427. 115138 doi:10.1016/j.cam.2023.115138
Li, Nan, Ding, Jian, Yin, Jun-Feng (2022) Modified relaxation two-sweep modulus-based matrix splitting iteration method for solving a class of implicit complementarity problems. Journal of Computational and Applied Mathematics, 413. 114370 doi:10.1016/j.cam.2022.114370
Wu, Shi-Liang, Li, Cui-Xia (2016) Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems. Journal of Computational and Applied Mathematics, 302. 327-339 doi:10.1016/j.cam.2016.02.011
Mezzadri, Francesco, Galligani, Emanuele (2025) Modulus-based matrix splitting algorithms for generalized complex-valued horizontal linear complementarity problems. Journal of Computational and Applied Mathematics, 460. doi:10.1016/j.cam.2024.116440
Wang, Dan, Li, Jicheng (2024) Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem. Journal of Computational and Applied Mathematics, 437. Elsevier BV. 115430 doi:10.1016/j.cam.2023.115430
He, Jiewen, Vong, Seakweng (2025) Newton-type methods for solving vertical linear complementarity problems. Journal of Computational and Applied Mathematics, 460. doi:10.1016/j.cam.2024.116418
Li, Cui-Xia, Wu, Shi-Liang (2023) Modulus-based matrix splitting methods for complex linear complementarity problem. Journal of Computational and Applied Mathematics, 427. 115139 doi:10.1016/j.cam.2023.115139
Krejić, Nataša, Krklec Jerinkić, Nataša, Ostojić, Tijana (2023) An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems. Journal of Computational and Applied Mathematics, 423. 114943 doi:10.1016/j.cam.2022.114943
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 9, 2025 10:59:56
Go to top of page