Vote for your favorite mineral in #MinCup25! - Silver vs. Baryte
Are you ready for beautiful utility as sparkling silver competes against hefty baryte?
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

Chen, Xiaojun, Fukushima, Masao (2004) A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints. Computational Optimization and Applications, 27 (3). 223-246 doi:10.1023/b:coap.0000013057.54647.6d

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints
JournalComputational Optimization and Applications
AuthorsChen, XiaojunAuthor
Fukushima, MasaoAuthor
Year2004 (March)Volume27
Issue3
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1023/b:coap.0000013057.54647.6dSearch in ResearchGate
Generate Citation Formats
Mindat Ref. ID9538433Long-form Identifiermindat:1:5:9538433:7
GUID0
Full ReferenceChen, Xiaojun, Fukushima, Masao (2004) A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints. Computational Optimization and Applications, 27 (3). 223-246 doi:10.1023/b:coap.0000013057.54647.6d
Plain TextChen, Xiaojun, Fukushima, Masao (2004) A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints. Computational Optimization and Applications, 27 (3). 223-246 doi:10.1023/b:coap.0000013057.54647.6d
In(2004, March) Computational Optimization and Applications Vol. 27 (3) Springer Science and Business Media LLC

See Also

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

Xu, Song (2004) A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints. Computational Optimization and Applications, 27 (3). 285-303 doi:10.1023/b:coap.0000013060.16224.31
Hu, Ming, Fukushima, Masao (2012) Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints. Computational Optimization and Applications, 52 (2). 415-437 doi:10.1007/s10589-011-9416-0
Zhou, Guanglu, Toh, Kim-Chuan, Zhao, Gongyun (2004) Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems. Computational Optimization and Applications, 27 (3). 269-283 doi:10.1023/b:coap.0000013059.84424.af
Li, Dong-Hui, Fukushima, Masao, Qi, Liqun, Yamashita, Nobuo (2004) Regularized Newton Methods for Convex Minimization Problems with Singular Solutions. Computational Optimization and Applications, 28 (2). 131-147 doi:10.1023/b:coap.0000026881.96694.32
Pan, Ping-Qi (2004) A Dual Projective Pivot Algorithm for Linear Programming. Computational Optimization and Applications, 29 (3). 333-346 doi:10.1023/b:coap.0000044185.69640.54
Demetriou, I.C. (2004) Least Squares Convex-Concave Data Smoothing. Computational Optimization and Applications, 29 (2). 197-217 doi:10.1023/b:coap.0000042030.54793.47
(2004) COAP Best Paper Award. Computational Optimization and Applications, 27 (1). 115pp. doi:10.1023/b:coap.0000005029.22801.b3
Drummond, L.M. Graña, Iusem, A.N. (2004) A Projected Gradient Method for Vector Optimization Problems. Computational Optimization and Applications, 28 (1). 5-29 doi:10.1023/b:coap.0000018877.86161.8b
Lin, Gui-Hua, Chen, Xiaojun, Fukushima, Masao (2009) Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization. Mathematical Programming, 116 (1). 343-368 doi:10.1007/s10107-007-0119-3
Liu, Xinwei, Perakis, Georgia, Sun, Jie (2006) A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints. Computational Optimization and Applications, 34 (1). 5-33 doi:10.1007/s10589-005-3075-y
Liu, Shisen, Chen, Xiaojun (2023) Lifted stationary points of sparse optimization with complementarity constraints. Computational Optimization and Applications, 84 (3) 973-1003 doi:10.1007/s10589-022-00444-1
 
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 5, 2025 09:29:48
Go to top of page