• ve08

  • Referenced in 142 articles [sw05141]
  • unconstrained optimization of partially separable functions We consider the problem of minimizing a smooth objective ... function f of n real variables. For n>200 we can only hope to locate ... computing time by using a minimization algorithm that exploits some special structure ... which case conjugate gradient and limited memory variable metric methods were found to work quite...
  • NPSOL

  • Referenced in 147 articles [sw07420]
  • which may include simple bounds on the variables, linear constraints, and smooth nonlinear constraints ... NPSOL uses a sequential quadratic programming (SQP) algorithm, in which each search direction ... linear constraints, and nonlinear constraints are treated separately. Hence it is especially effective...
  • Latent GOLD

  • Referenced in 93 articles [sw11673]
  • nominal variables by Goodman (1974a, 1974b) who also developed the maximum likelihood algorithm that serves ... others. FM models seek to separate out or ’un-mix’ data that is assumed...
  • RSVM

  • Referenced in 52 articles [sw15261]
  • Machines. An algorithm is proposed which generates a nonlinear kernel-based separating surface that requires ... optimization problem with very few variables corresponding to the 1% of the data kept...
  • MAD

  • Referenced in 25 articles [sw12534]
  • computer codes written in MATLAB. The underlying algorithm is the well-known forward mode ... automatic differentiation implemented via operator overloading on variables of the class fmad. The main distinguishing ... feature of this MATLAB implementation is the separation of the linear combination of derivative vectors...
  • TIMP

  • Referenced in 9 articles [sw07964]
  • separable nonlinear models using partitioned variable projection, a variant of the variable projection algorithm that...
  • SOLA-VOF

  • Referenced in 40 articles [sw24125]
  • SOLA-VOF: A solution algorithm for transient fluid flow with multiple free boundaries. In this ... used for calculations involving two fluids separated by a sharp interface. In either case ... which is composed of rectangular cells of variable size. SOLA-VOF is an easy...
  • PolyTop

  • Referenced in 36 articles [sw07629]
  • analysis routine and the optimization algorithm are separated from the specific choice of topology optimization ... they are related to the design variables of the discrete optimization problem. The Matlab code...
  • SDSAT

  • Referenced in 2 articles [sw00842]
  • uniform adequate ranges for variables appearing in separation predicates. This phase is similar to previous ... domain encoding approaches, but uses a novel algorithm Nu-SMOD with 1--2 orders ... performance and smaller ranges for variables. Furthermore, the Separation Logic formula is not transformed into ... also from the theory-specific graph-based algorithms (characteristic of lazy approaches). Experimental results show...
  • modbh

  • Referenced in 4 articles [sw25990]
  • Navier-Stokes equations. We develop a separation of variables representation for this equation in polar ... used in conjunction with fast algorithms to accelerate the solution of the modified biharmonic equation...
  • NAPHEAP

  • Referenced in 8 articles [sw23701]
  • separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm called ... been developed to solve this problem. The algorithm solves the Karush-Kuhn-Tucker system using ... starting guess is computed using the variable fixing method or is supplied by the user...
  • StrSolve

  • Referenced in 5 articles [sw21857]
  • defined interface. This separation enables independent improvement of string constraint solving algorithms and reduces client ... procedure that reasons about equations over string variables. Our approach scales well with respect...
  • BREAKUP

  • Referenced in 4 articles [sw02078]
  • called BREAKUP, which processes CNF formulas by separating them into “connected components”, is introduced. BREAKUP ... using Iwama’s 𝐈𝐒 Algorithm. The complexity of this algorithm is shown ... clauses and nv is the number of variables...
  • GLOPEQ

  • Referenced in 15 articles [sw07709]
  • crucial phase in the modeling of many separation processes. For conditions of constant temperature ... problems (G) and (S), but a combined algorithm employs them in tandem, using ... features of the combined algorithm are that (i) as much information as is possible ... plane criterion, as this problem contains fewer variables than the minimization of the Gibbs free...
  • RSKC

  • Referenced in 2 articles [sw23852]
  • Robust and Sparse K-Means Clustering Algorithm. Witten and Tibshirani (2010) proposed an algorithim ... simultaneously find clusters and select clustering variables, called sparse K-means (SK-means). SK-means ... fraction of noise variables (that is, variables without useful information to separate the clusters ... robust and sparse K-means clustering algorithm implemented in the R package RSKC. We demonstrate...
  • ManiSolve

  • Referenced in 1 article [sw34623]
  • variables. We propose an algorithm for finding good approximations to all well-separated solutions...
  • SOPRA

  • Referenced in 7 articles [sw12607]
  • technology, which provides pairs of short reads separated by a known distance along the genome ... short reads. The main focus of the algorithm is selecting a sufficiently large subset ... presented as an optimization problem for variables associated with vertices and with edges...
  • BSSGUI

  • Referenced in 1 article [sw32706]
  • easy operation of several Blind Source Separation (BSS) algorithms together with adjustment of their parameters ... multiple signal plots, and saving of output variables to the base Matlab workspace...
  • LSA

  • Referenced in 4 articles [sw22887]
  • Algorithm 896: LSA: Algorithms for large-scale optimization. We present 14 basic Fortran subroutines ... optimization problems, are based on limited-memory variable metric methods. Subroutine PNET, also intended ... Subroutines PSED and PSEC, intended for partially separable optimization problems, are based on partitioned variable ... nonsmooth partially separable optimization problems, is based on partitioned variable metric updates...
  • IgTree

  • Referenced in 1 article [sw23151]
  • from immunoglobulin variable region gene sequences. The IgTree program implements the algorithm we developed ... Each tree node represents a single mutation separating the sequences. The mutations that separate ... basis. The algorithm has proven useful in several studies of immunoglobulin variable region gene mutations...