EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Approximating Hessians in unco...
  • More details
Cover Image

Approximating Hessians in unconstrained optimization arising from discretized problems

Year of publication:
2011
Authors: Malmedy, Vincent ; Toint, Philippe
Published in:
Computational Optimization and Applications. - Springer. - Vol. 50.2011, 1, p. 1-22
Publisher: Springer
Subject: Unconstrained optimization | Discretized problems | Sparsity | Partial separability | Numerical experiences
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10009325273
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • Inexact trust region PGC method for large sparse unconstrained optimization

      Li, Junxiang, (2012)

    • A nonmonotone PSB algorithm for solving unconstrained optimization

      Li, Jiao, (2012)

    • A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization

      Mariani, Viviana Cocco, (2011)

    • More ...
    Similar items by person
    • Using approximate secant equations in limited memory methods for multilevel unconstrained optimization

      Gratton, Serge, (2012)

    • An adaptive Monte Carlo algorithm for computing mixed logit estimators

      Bastin, Fabian, (2006)

    • <Emphasis FontCategory="SansSerif">CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization

      Gould, Nicholas, (2015)

    • More ...
    A service of the
    zbw
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...