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

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

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA new linesearch algorithm for nonlinear least squares problems
JournalMathematical Programming
AuthorsLindström, PerAuthor
Wedin, Per-ÅkeAuthor
Year1984 (July)Volume29
Issue3
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1007/bf02591997Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11264892Long-form Identifiermindat:1:5:11264892:7
GUID0
Full ReferenceLindströ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
Plain TextLindströ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
In(1984, July) Mathematical Programming Vol. 29 (3) Springer Science and Business Media LLC

See Also

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

Yabe, Hiroshi, Takahashi, Toshihiko (1991) Factorized quasi-Newton methods for nonlinear least squares problems. Mathematical Programming, 51 (1). 75-100 doi:10.1007/bf01586927
Björck, Åke (1984) A General Updating Algorithm for Constrained Linear Least Squares Problems. SIAM Journal on Scientific and Statistical Computing, 5 (2) 394-402 doi:10.1137/0905029
Mathai, A. M., Katiyar, R. S. (1996) A new algorithm for nonlinear least squares. Journal of Mathematical Sciences, 81. 2454-2463 doi:10.1007/bf02362352
Haskell, Karen H., Hanson, Richard J. (1981) An algorithm for linear least squares problems with equality and nonnegativity constraints. Mathematical Programming, 21 (1). 98-118 doi:10.1007/bf01584232
Mifflin, Robert (1979) A stable method for solving certain constrained least squares problems. Mathematical Programming, 16 (1). 141-158 doi:10.1007/bf01582105
Robinson, Stephen M. (1972) A quadratically-convergent algorithm for general nonlinear programming problems. Mathematical Programming, 3 (1). 145-156 doi:10.1007/bf01584986
Bartholomew-Biggs, M. C. (1977) The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals. Mathematical Programming, 12 (1). 67-80 doi:10.1007/bf01593770
Mcdiarmid, Colin (1990) On the improvement per iteration in Karmarkar's algorithm for linear programming. Mathematical Programming, 46 (1). 299-320 doi:10.1007/bf01585747
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
Mehrotra, Sanjay, Zhang, He (2014) Models and algorithms for distributionally robust least squares problems. Mathematical Programming, 146 (1). 123-141 doi:10.1007/s10107-013-0681-9
Anstreicher, Kurt M. (1990) A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm. Mathematical Programming, 47 (1). 337-351 doi:10.1007/bf01580868
 
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 12:52:11
Go to top of page