Watch the Dallas Symposium LIVE, and fundraiser auction
Ticket proceeds support mindat.org! - click here...
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

De Leone, Renato, Gaudioso, Manlio, Grippo, Luigi (1984) Stopping criteria for linesearch methods without derivatives. Mathematical Programming, 30 (3). 285-300 doi:10.1007/bf02591934

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleStopping criteria for linesearch methods without derivatives
JournalMathematical Programming
AuthorsDe Leone, RenatoAuthor
Gaudioso, ManlioAuthor
Grippo, LuigiAuthor
Year1984 (October)Volume30
Issue3
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1007/bf02591934Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11264950Long-form Identifiermindat:1:5:11264950:4
GUID0
Full ReferenceDe Leone, Renato, Gaudioso, Manlio, Grippo, Luigi (1984) Stopping criteria for linesearch methods without derivatives. Mathematical Programming, 30 (3). 285-300 doi:10.1007/bf02591934
Plain TextDe Leone, Renato, Gaudioso, Manlio, Grippo, Luigi (1984) Stopping criteria for linesearch methods without derivatives. Mathematical Programming, 30 (3). 285-300 doi:10.1007/bf02591934
In(1984, October) Mathematical Programming Vol. 30 (3) Springer Science and Business Media LLC

See Also

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

Lindström, Per, Wedin, Per-Åke (1984) A new linesearch algorithm for nonlinear least squares problems. Mathematical Programming, 29 (3). 268-296 doi:10.1007/bf02591997
Gaudioso, Manlio, Monaco, Maria Flavia (1982) A bundle type approach to the unconstrained minimization of convex nonsmooth functions. Mathematical Programming, 23 (1). 216-226 doi:10.1007/bf01583790
Powell, M.J.D. (2003) On trust region methods for unconstrained minimization without derivatives. Mathematical Programming, 97 (3). 605-623 doi:10.1007/s10107-003-0430-6
Ye, Yinyu (1992) On affine scaling algorithms for nonconvex quadratic programming. Mathematical Programming, 56 (1). 285-300 doi:10.1007/bf01580903
Di Pillo, Gianni, Facchinei, Francisco, Grippo, Luigi (1992) An RQP algorithm using a differentiable exact penalty function for inequality constrained problems. Mathematical Programming, 55 (1). 49-68 doi:10.1007/bf01581190
de Werra, D. (1984) A decomposition property of polyhedra. Mathematical Programming, 30 (3). 261-266 doi:10.1007/bf02591932
De Leone, Renato, Fasano, Giovanni, Sergeyev, Yaroslav D. (2018) Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming. Computational Optimization and Applications, 71 (1). 73-93 doi:10.1007/s10589-017-9957-y
Grippo, Luigi, Palagi, Laura, Piccialli, Veronica (2011) An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Mathematical Programming, 126 (1). 119-146 doi:10.1007/s10107-009-0275-8
Monteiro, Renato. D. C. (2003) First- and second-order methods for semidefinite programming. Mathematical Programming, 97 (1). 209-244 doi:10.1007/s10107-003-0451-1
Grippo, Luigi, Palagi, Laura, Piacentini, Mauro, Piccialli, Veronica, Rinaldi, Giovanni (2012) SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances. Mathematical Programming, 136 (2). 353-373 doi:10.1007/s10107-012-0593-0
Patel, Vivak (2022) Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions. Mathematical Programming, 195 (1) 693-734 doi:10.1007/s10107-021-01710-6
 
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 15, 2025 22:57:56
Go to top of page