Vote for your favorite mineral in #MinCup25! - Sanidine vs. Hematite
It's a pair of often-overlooked classics as potassium feldspar sanidine competes with iron ore hematite.
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

Corradi, Gianfranco (2004) A method for nonsmooth optimization problems. International Journal of Computer Mathematics, 81. 693-705 doi:10.1080/0020716031000148197

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA method for nonsmooth optimization problems
JournalInternational Journal of Computer Mathematics
AuthorsCorradi, GianfrancoAuthor
Year2004 (June)Volume81
PublisherInforma UK Limited
DOIdoi:10.1080/0020716031000148197Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6644912Long-form Identifiermindat:1:5:6644912:0
GUID0
Full ReferenceCorradi, Gianfranco (2004) A method for nonsmooth optimization problems. International Journal of Computer Mathematics, 81. 693-705 doi:10.1080/0020716031000148197
Plain TextCorradi, Gianfranco (2004) A method for nonsmooth optimization problems. International Journal of Computer Mathematics, 81. 693-705 doi:10.1080/0020716031000148197
In(n.d.) International Journal of Computer Mathematics Vol. 81. Informa UK Limited

See Also

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

Corradi, Gianfranco (2007) A variational method for unconstrained optimization problems. International Journal of Computer Mathematics, 84. 491-503 doi:10.1080/00207160701223078
Corradi, Gianfranco (2011) A method for non-differentiable optimization problems. International Journal of Computer Mathematics, 88. 3750-3761 doi:10.1080/00207160.2011.620095
Corradi, Gianfranco (1986) A second order method for unconstrained optimization. International Journal of Computer Mathematics, 20. 253-260 doi:10.1080/00207168608803547
Corradi, Gianfranco (2016) A quasi-Newton method for unconstrained non-smooth problems. International Journal of Computer Mathematics, 93. 128-141 doi:10.1080/00207160.2014.990896
Corradi, Gianfranco (1991) Quasi-newton methods for monlinear equations and unconstrained optimization problems. International Journal of Computer Mathematics, 38. 71-89 doi:10.1080/00207169108803959
Corradi, Gianfranco (1992) An algorithm for unconstrained optimization. International Journal of Computer Mathematics, 45. 123-131 doi:10.1080/00207169208804122
Corradi, Gianfranco (1997) A trust region algorithm for unconstrained optimization. International Journal of Computer Mathematics, 65. 109-119 doi:10.1080/00207169708804601
Corradi, Gianfranco (2000) A trust region algorithm for constrained optimization. International Journal of Computer Mathematics, 74. 225-236 doi:10.1080/00207160008804936
Corradi, Gianfranco (1999) A logarithm barrier method for linear programming. International Journal of Computer Mathematics, 73. 93-104 doi:10.1080/00207169908804882
Corradi, Gianfranco (2005) A quasi-Newton method for non-smooth equations. International Journal of Computer Mathematics, 82. 573-581 doi:10.1080/00207160512331331183
Novati, Paolo (2004) A low cost Arnoldi method for large linear initial value problems. International Journal of Computer Mathematics, 81. 835-844 doi:10.1080/00207160410001708814
 
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 7, 2025 20:13:37
Go to top of page