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

Ubhaya, V.A. (2004) An algorithm for discrete approximation by quasi-convex functions on Rm. Computers & Mathematics with Applications, 47. 1707-1712 doi:10.1016/j.camwa.2004.06.023

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleAn algorithm for discrete approximation by quasi-convex functions on Rm
JournalComputers & Mathematics with Applications
AuthorsUbhaya, V.A.Author
Year2004 (May)Volume47
PublisherElsevier BV
DOIdoi:10.1016/j.camwa.2004.06.023Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6571021Long-form Identifiermindat:1:5:6571021:6
GUID0
Full ReferenceUbhaya, V.A. (2004) An algorithm for discrete approximation by quasi-convex functions on Rm. Computers & Mathematics with Applications, 47. 1707-1712 doi:10.1016/j.camwa.2004.06.023
Plain TextUbhaya, V.A. (2004) An algorithm for discrete approximation by quasi-convex functions on Rm. Computers & Mathematics with Applications, 47. 1707-1712 doi:10.1016/j.camwa.2004.06.023
In(n.d.) Computers & Mathematics with Applications Vol. 47. Elsevier BV

See Also

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

Ubhaya, V.A. (1987) An O(n) algorithm for least squares quasi-convex approximation. Computers & Mathematics with Applications, 14. 583-590 doi:10.1016/0898-1221(87)90185-4
Ubhaya, Vasant A. (1984) O(n) algorithms for discrete n-point approximation by quasi-convex functions. Computers & Mathematics with Applications, 10. 365-368 doi:10.1016/0898-1221(84)90064-6
Liu, Ming-Hong, Ubhaya, Vasant A. (2009) An O(n) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions. Computers & Mathematics with Applications, 58. 776-783 doi:10.1016/j.camwa.2009.04.003
Ubhaya, Vasant A (1989) Lp approximation by quasi-convex and convex functions. Journal of Mathematical Analysis and Applications, 139. 574-585 doi:10.1016/0022-247x(89)90130-3
Ubhaya, Vasant A. (1983) Linear time algorithms for convex and monotone approximation. Computers & Mathematics with Applications, 9. 633-643 doi:10.1016/0898-1221(83)90121-9
Ubhaya, Vasant A (1979) An O(n) algorithm for discrete n-point convex approximation with applications to continuous case. Journal of Mathematical Analysis and Applications, 72. 338-354 doi:10.1016/0022-247x(79)90293-2
Hahm, Nahmwoo, Il Hong, Bum (2004) An approximation by neural networkswith a fixed weight. Computers & Mathematics with Applications, 47. 1897-1903 doi:10.1016/j.camwa.2003.06.008
Jankowski, T. (2004) Quadratic approximation of solutions for differential equations with nonlinear boundary conditions. Computers & Mathematics with Applications, 47. 1619-1626 doi:10.1016/j.camwa.2004.06.009
Guessab, Allal (2013) Generalized barycentric coordinates and approximations of convex functions on arbitrary convex polytopes. Computers & Mathematics with Applications, 66. 1120-1136 doi:10.1016/j.camwa.2013.07.014
Alomari, M., Darus, M., Kirmaci, U.S. (2010) Refinements of Hadamard-type inequalities for quasi-convex functions with applications to trapezoidal formula and to special means. Computers & Mathematics with Applications, 59. 225-232 doi:10.1016/j.camwa.2009.08.002
Chen, Guanghua, Chen, Guangming (2011) A numerical algorithm based on a variational iterative approximation for the discrete Hamilton–Jacobi–Bellman (HJB) equation. Computers & Mathematics with Applications, 61. 901-907 doi:10.1016/j.camwa.2010.12.038
 
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 08:39:41
Go to top of page