• KELLEY

  • Referenced in 609 articles [sw04829]
  • complete generality and confine our scope to algorithms that are easy to implement ... into two parts. The first part, occupying approximately 100 pages, is devoted to the optimization ... second part of the book, which is approximately 50 pages long, deals with the optimization ... used to demonstrate the behavior of optimization algorithms. Chapter 7 introduces implicit filtering, a technique...
  • LKH

  • Referenced in 129 articles [sw04735]
  • highly effective. Even though the algorithm is approximate, optimal solutions are produced with an impressively ... nontrivial instance solved to optimality). Furthermore, the algorithm has improved the best known solutions...
  • SNOPT

  • Referenced in 523 articles [sw02300]
  • gradients are sparse. We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit ... Newton approximation to the Hessian of the Lagrangian and uses a reduced-Hessian algorithm (SQOPT...
  • Outward rotations

  • Referenced in 44 articles [sw08660]
  • performance of several semidefinite programming based approximation algorithms. Using outward rotations, we obtain an approximation ... Williamson. We also obtain an improved approximation algorithm for MAX NAE-f3g-SAT. Finally ... also be used to obtain improved approximation algorithms ... used semidefinite programming to obtain an approximation algorithm...
  • CGAL

  • Referenced in 362 articles [sw00118]
  • Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations and Delaunay ... properties, and approximation of ridges and umbilics), alpha shapes, convex hull algorithms...
  • CoSaMP

  • Referenced in 208 articles [sw08727]
  • basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from...
  • PITCON

  • Referenced in 259 articles [sw04244]
  • Algorithm 596: Methods for solving systems of nonlinear equations. Chapter 7: Parametrized systems of equations ... equations approach, the code PITCON and simplicial approximation of manifolds are contained. (netlib contin...
  • GRASP

  • Referenced in 130 articles [sw01094]
  • Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP (greedy...
  • EGO

  • Referenced in 362 articles [sw07588]
  • integer constraints. The idea of the EGO algorithm is to first fit a response surface ... minimum of the surface and improving the approximation by sampling where the prediction error...
  • redbKIT

  • Referenced in 186 articles [sw12977]
  • spaces using greedy algorithms and proper orthogonal decomposition techniques, investigate their approximation properties and analyze ... allows the reader to easily implement the algorithms illustrated throughout the text. The book will...
  • na10

  • Referenced in 49 articles [sw11511]
  • algorithm for computing polynomial zeros, based on Aberth’s method, is presented. The starting approximations ... rounding error analysis, guarantees that the computed approximations are the exact zeros of a “nearby ... This implies the backward stability of our algorithm. We provide a Fortran 77 implementation ... Fortran 77 implementation of our algorithm computed approximations to all the zeros within the relative...
  • DICOPT

  • Referenced in 35 articles [sw04938]
  • extensions of the outer-approximation algorithm for the equality relaxation strategy. The MINLP algorithm inside...
  • SpaceEx

  • Referenced in 70 articles [sw10939]
  • Hybrid Systems. We present a scalable reachability algorithm for hybrid systems with piecewise affine ... compute an over-approximation of the reachable states. The algorithm improves over previous work ... improved approximation model, which drastically improves the accuracy of the algorithm. The algorithm is implemented...
  • Bonmin

  • Referenced in 190 articles [sw04766]
  • hybrid algorithms, of which branch-and-bound and polyhedral outer approximation are the two extreme...
  • UOBYQA

  • Referenced in 64 articles [sw07576]
  • UOBYQA: unconstrained optimization by quadratic approximation. A new algorithm for general unconstrained optimization calculations ... adjustment of trust region radii. par The algorithm works with the Lagrange functions ... estimate of the error of the quadratic approximation of the function being minimized...
  • CALMA

  • Referenced in 105 articles [sw03235]
  • developed optimization algorithms based on branch-and-cut and constraint satisfaction, and approximation techniques including...
  • SQPlab

  • Referenced in 160 articles [sw05161]
  • hand, as a Newton method, the SQP algorithm converges very rapidly, meaning that it requires ... iterations (hence QP solves) to find an approximate solution with a good precision (this ... Therefore, one can say that the SQP algorithm is an appropriate approach when the evaluation...
  • Eigensolve

  • Referenced in 25 articles [sw11986]
  • iterated eigenvalue algorithm for approximating roots of univariate polynomials. The author studies an iterative algorithm ... that approximates all roots of a univariate polynomial. The iteration is based on floating-point ... conditioned polynomials are carefully implemented for the algorithms...
  • AMD

  • Referenced in 55 articles [sw00039]
  • routines that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior...
  • AAA

  • Referenced in 21 articles [sw36858]
  • rational approximation. We introduce a new algorithm for approximation by rational functions on a real ... Even on a disk or interval the algorithm may outperform existing methods, and on more ... ideas are (1) representation of the rational approximant in barycentric form with interpolation at certain ... based on (1). We present the core algorithm with a Matlab code and nine applications...