• ve08

  • Referenced in 132 articles [sw05141]
  • which case conjugate gradient and limited memory variable metric methods were found to work quite...
  • MINPACK-2

  • Referenced in 51 articles [sw04751]
  • limited memory quasi Newton method. Directories contain software, drivers and manuals. (dcsrch.f, the step-size...
  • LDGB

  • Referenced in 29 articles [sw07134]
  • limited memory bundle method for large-scale nonsmooth optimization Many practical optimization problems involve nonsmooth ... direct application of smooth gradient-based methods may lead to a failure ... describe a new limited memory variable metric based bundle method for nonsmooth large-scale optimization...
  • Algorithm 913

  • Referenced in 21 articles [sw12775]
  • Gijzen [2008] is a very efficient limited memory method for solving large nonsymmetric systems...
  • SNOPT

  • Referenced in 459 articles [sw02300]
  • scale constrained optimization. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained ... solver. It is based on a limited-memory quasi-Newton approximation to the Hessian...
  • Poblano

  • Referenced in 9 articles [sw04186]
  • Polak-Ribiere, Hestenes-Stiefel), a limited-memory quasi-Newton method using BFGS updates to approximate...
  • NSPCG

  • Referenced in 30 articles [sw00636]
  • computers.\parSince the vectorizability of an iterative method depends greatly on the matrix structure, NSPCG ... memory space is limited.\parSome of the basic preconditioners that are available are point methods...
  • HANSO

  • Referenced in 9 articles [sw05271]
  • nonsmooth, including BFGS, limited memory BFGS and gradient sampling methods, based on weak Wolfe line...
  • LMBM

  • Referenced in 3 articles [sw06158]
  • LMBM is a limited memory bundle method for general, possible nonconvex, nonsmooth (nondifferentiable) large-scale...
  • Algorithm 734

  • Referenced in 3 articles [sw04692]
  • implementation of the Buckley-LeNir method, Nocedal’s limited memory algorithm, and an experimental limited...
  • LSA

  • Referenced in 4 articles [sw22887]
  • optimization problems, are based on limited-memory variable metric methods. Subroutine PNET, also intended...
  • pTatin3D

  • Referenced in 8 articles [sw27642]
  • best available methods utilising stored matrices (plagued by memory bandwidth limitations), exploits local element structure...
  • PARSEC

  • Referenced in 25 articles [sw09610]
  • characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies ... computing applications and used a limited number of synchronization methods. PARSEC includes emerging applications...
  • SLICOT

  • Referenced in 71 articles [sw01095]
  • performance with respect to speed and memory requirements. Although important because of ever increasing complexity ... evaluation of the performance of a method as well as the implementation with respect ... method and its implementation in extreme situations, i.e., for problems where the limit...
  • SLMQN

  • Referenced in 2 articles [sw00879]
  • Fortran code of subspace limited memory quasi-Newton method for large-scale bound constrained nonlinear ... optimization. SLMQN is a subspace limited memory quasi-Newton algorithm for solving large-scale bound...
  • TRLan

  • Referenced in 53 articles [sw04029]
  • software package implements the thick-restart Lanczos method. It can be used on either ... utility functions such functions such as dynamic memory management, timing functions, random number generator ... modified. In this software, this modification is limited to one subroutine. It also...
  • OptimPack

  • Referenced in 1 article [sw26295]
  • VMLM-B: a variable metric method with limited memory requirements and, possibly, bound constraints ... parameters. The algorithm is based on limited memory BFGS updates [1] with Moré & Thuente inexact ... gradient projection to account for bounds. The method has been described in [3]. In order...
  • MSS

  • Referenced in 5 articles [sw08530]
  • method computes the minimizer of a quadratic function defined by a limited-memory BFGS matrix ... adaptation of the Moré-Sorensen direct method into an L-BFGS setting for large-scale...
  • Glmulti

  • Referenced in 8 articles [sw10544]
  • large candidate sets by avoiding memory limitation, facilitating parallelization and providing, in addition to exhaustive ... screening, a compiled genetic algorithm method. This article briefly presents the statistical framework and introduces...
  • PENSDP

  • Referenced in 18 articles [sw05119]
  • using iterative solvers The limiting factors of second-order methods for large-scale semidefinite optimization ... particular algorithm based on the modified barrier method, we propose to use iterative solvers instead ... direct factorization techniques. The preconditioned conjugate gradient method proves to be a viable alternative ... formula. This leads to huge savings in memory requirements and, for certain problems, to further...