• AdaBoost.MH

  • Referenced in 441 articles [sw08517]
  • problems. We show how the resulting learning algorithm can be applied to a variety ... update technique to derive a new boosting algorithm. This boosting algorithm does not require ... about the performance of the weak learning algorithm. We also study generalizations ... boosting algorithm to the problem of learning functions whose range, rather than being binary...
  • SNOPT

  • Referenced in 495 articles [sw02300]
  • SNOPT: An SQP algorithm for large-scale constrained optimization. Sequential quadratic programming (SQP) methods have ... gradients are sparse. We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit ... Lagrangian and uses a reduced-Hessian algorithm (SQOPT) for solving the QP subproblems...
  • ARPACK

  • Referenced in 774 articles [sw04218]
  • operations. This software is based upon an algorithmic variant of the Arnoldi process called...
  • JDQR

  • Referenced in 473 articles [sw04021]
  • Matlab® implementation of the JDQR algorithm. The JDQR algorithm can be used for computing ... complex, Hermitian or non-Hermitian, .... The algorithm is effective especially in case A is sparse...
  • Simulink

  • Referenced in 695 articles [sw04348]
  • range of tools that let you develop algorithms, analyze and visualize simulations, create batch processing...
  • minpack

  • Referenced in 685 articles [sw05310]
  • raised in the first part by discussing algorithms for unconstrained optimization. Because the discussion...
  • Knapsack

  • Referenced in 452 articles [sw04723]
  • respect to relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results ... actual performance of the most effective algorithms published...
  • CGAL

  • Referenced in 337 articles [sw00118]
  • easy access to efficient and reliable geometric algorithms in the form of a C++ library ... using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms ... ridges and umbilics), alpha shapes, convex hull algorithms (in 2D, 3D and dD), search structures ... data structures. All these data structures and algorithms operate on geometric objects like points...
  • glasso

  • Referenced in 353 articles [sw07432]
  • alternatives. The graphical lasso [5] is an algorithm for learning the structure in an undirected ... explain this behavior, and propose new algorithms that appear to outperform glasso. By studying ... precision matrix Θ. We propose similar primal algorithms p-glasso and dp-glasso, that also ... optimization target. We study all of these algorithms, and in particular different approaches to solving...
  • SDPT3

  • Referenced in 597 articles [sw04009]
  • improve the efficiency and stability of the algorithm are incorporated. For example, step-lengths associated...
  • SparseMatrix

  • Referenced in 594 articles [sw04629]
  • development and performance evaluation of sparse matrix algorithms. It allows for robust and repeatable experiments...
  • SPEA2

  • Referenced in 428 articles [sw06686]
  • SPEA2 - The Strength Pareto Evolutionary Algorithm 2: SPEA2 in an elitist multiobjective evolutionary algorithm...
  • SIFT

  • Referenced in 591 articles [sw16554]
  • known objects using a fast nearest-neighbor algorithm, followed by a Hough transform to identify...
  • BRENT

  • Referenced in 407 articles [sw14021]
  • BRENT Algorithms for Minimization Without Derivatives. BRENT is a C library which contains algorithms...
  • Chaff

  • Referenced in 561 articles [sw06916]
  • variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development...
  • LSQR

  • Referenced in 343 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems. An iterative method is given ... comparing LSQR with several other conjugate-gradient algorithms, indicating that LSQR is the most reliable ... algorithm when A is ill-conditioned...
  • GQTPAR

  • Referenced in 305 articles [sw07451]
  • trust region step We propose an algorithm for the problem of minimizing a quadratic function ... ellipsoidal constraint and show that this algorithm is guaranteed to produce a nearly optimal solution ... also consider the use of this algorithm in a trust region Newton’s method ... which is a Fortran implementation of our algorithm, show that GQTPAR is quite successful...
  • deal.ii

  • Referenced in 515 articles [sw03516]
  • interface to the complex data structures and algorithms required. The main aim of deal.II...
  • LINPACK

  • Referenced in 512 articles [sw04209]
  • least-squares problems. LINPACK uses column-oriented algorithms to increase efficiency by preserving locality...
  • LBFGS-B

  • Referenced in 293 articles [sw05142]
  • Algorithm 778: L-BFGS-B Fortran subroutines for large-scale bound-constrained optimization L-BFGS ... limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds ... this case performs similarly to its predecessor, algorithm L-BFGS (Harwell routine VA15). The algorithm...