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

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

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleConvergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
JournalComputational Optimization and Applications
AuthorsZhou, GuangluAuthor
Toh, Kim-ChuanAuthor
Zhao, GongyunAuthor
Year2004 (March)Volume27
Issue3
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1023/b:coap.0000013059.84424.afSearch in ResearchGate
Generate Citation Formats
Mindat Ref. ID9538436Long-form Identifiermindat:1:5:9538436:4
GUID0
Full ReferenceZhou, 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
Plain TextZhou, 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
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.

Bellavia, Stefania, Pieraccini, Sandra (2004) Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming. Computational Optimization and Applications, 29 (3). 289-313 doi:10.1023/b:coap.0000044183.43473.34
Zhou, Guanglu, Toh, Kim-Chuan (2004) Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming. Mathematical Programming, 99 (2). 261-282 doi:10.1007/s10107-003-0431-5
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
Xu, Song (2000) The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions. Mathematical Programming, 87 (3). 501-517 doi:10.1007/s101070050009
Qinggang, Wang, Jinling, Zhao, Qingzhi, Yang (2010) Some non-interior path-following methods based on a scaled central path for linear complementarity problems. Computational Optimization and Applications, 46 (1). 31-49 doi:10.1007/s10589-008-9188-3
Wright, Stephen J. (1994) An infeasible-interior-point algorithm for linear complementarity problems. Mathematical Programming, 67 (1). 29-51 doi:10.1007/bf01582211
Wright, Stephen, Zhang, Yin (1996) A superquadratic infeasible-interior-point method for linear complementarity problems. Mathematical Programming, 73 (3). 269-289 doi:10.1007/bf02592215
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
Kheirfam, B. (2017) An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path. International Journal of Computer Mathematics, 94. 2271-2282 doi:10.1080/00207160.2017.1283020
Griva, Igor (2004) Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming. Computational Optimization and Applications, 29 (2). 173-195 doi:10.1023/b:coap.0000042029.73199.83
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
 
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: August 31, 2025 01:46:06
Go to top of page