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

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

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleNumerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming
JournalComputational Optimization and Applications
AuthorsGriva, IgorAuthor
Year2004 (November)Volume29
Issue2
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1023/b:coap.0000042029.73199.83Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID9538468Long-form Identifiermindat:1:5:9538468:3
GUID0
Full ReferenceGriva, 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
Plain TextGriva, 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
In(2004, November) Computational Optimization and Applications Vol. 29 (2) 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
Kuo, Yu-Ju, Mittelmann, Hans D. (2004) Interior Point Methods for Second-Order Cone Programming and OR Applications. Computational Optimization and Applications, 28 (3). 255-285 doi:10.1023/b:coap.0000033964.95511.23
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
Bergamaschi, Luca, Gondzio, Jacek, Zilli, Giovanni (2004) Preconditioning Indefinite Systems in Interior Point Methods for Optimization. Computational Optimization and Applications, 28 (2). 149-171 doi:10.1023/b:coap.0000026882.34332.1b
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
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
Rosen, J. Ben, Marcia, Roummel F. (2004) Convex Quadratic Approximation. Computational Optimization and Applications, 28 (2). 173-184 doi:10.1023/b:coap.0000026883.13660.84
Stix, Volker (2004) Finding All Maximal Cliques in Dynamic Graphs. Computational Optimization and Applications, 27 (2). 173-186 doi:10.1023/b:coap.0000008651.28952.b6
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
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
Cheng, Hao, Fang, Shu-Cherng, Lavery, John E. (2004) An Efficient Algorithm for Generating Univariate Cubic L1Splines. Computational Optimization and Applications, 29 (2). 219-253 doi:10.1023/b:coap.0000042031.03626.1b
 
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 30, 2025 06:21:11
Go to top of page