• ACCPM

  • Referenced in 59 articles [sw06707]
  • cutting plane method. Instead of solving every relaxed master problem to optimality ... current localization set. The projective algorithm is successfully applied for this purpose...
  • FEASPUMP

  • Referenced in 133 articles [sw04802]
  • sequence of fractional solutions of the LP relaxation, until a feasible one is eventually found ... improvement of the FP success rate, without slowing-down the method and with a significantly...
  • SDPNAL+

  • Referenced in 63 articles [sw13239]
  • first-order block-decomposition method for solving two-easy-block structured semidefinite programs”, Math. Program ... difficult SDP problems arising from the relaxations of quadratic assignment problems tested in SDPNAL ... efficiently, while SDPAD and 2EBD-HPE successfully solve 30 and 16 problems, respectively. In addition ... SDPNAL+ appears to be the only viable method currently available to solve large scale SDPs...
  • Gmunu

  • Referenced in 1 article [sw40452]
  • other methods such as direct methods, relaxation methods, successive over-relaxation. With multigrid acceleration ... assess the performance and robustness of multigrid methods in relativistic simulations, we develop a hydrodynamics...
  • PhaseMax

  • Referenced in 28 articles [sw24954]
  • call PhaseMax. Unlike other convex methods that use semidefinite relaxation and lift the phase retrieval ... higher dimension, PhaseMax is a ”non-lifting” relaxation that operates in the original signal dimension ... develop sharp lower bounds on the success probability of PhaseMax for a broad range...
  • MISQP

  • Referenced in 13 articles [sw06267]
  • modified sequential quadratic programming (SQP) method. Under the assumption that integer variables have a smooth ... successive quadratic approximations are applied. It is not assumed that integer variables are relaxable...
  • GpoSolver

  • Referenced in 2 articles [sw15713]
  • successful methods for solving such problems is based on convex linear matrix inequality (LMI) relaxations...
  • rL-GenSVM

  • Referenced in 2 articles [sw34760]
  • tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine ... small-sample gene expression data and successfully separate the different subtypes of tumor or between ... paper, we present a new method for tumor classification -- relaxed Lasso (least absolute shrinkage...
  • SSORPCG

  • Referenced in 1 article [sw03024]
  • condition that the symmetric successive overrelaxation (SSOR) preconditioned conjugate gradient method (namely, SSORPCG) is relatively ... insensitive to the exact choice of the relaxation factor, this paper provides a test algorithm...
  • IDSOLVER

  • Referenced in 4 articles [sw16824]
  • into the framework of the specific method chosen. Furthermore, there is a paucity of general ... linear IDE. The solver performs successive relaxation iterations until convergence is achieved. The user ... numerical examples from the literature, that the method is robust, fast and accurate...
  • AGGJE

  • Referenced in 4 articles [sw07163]
  • than those of the usual finite element method (FEM). This paper presents an efficient ... procedure. Based on the widely used Successive Over-Relaxation-Preconditioned Conjugate Gradient (SSOR-PCG) scheme ... computational cost is comparable with the traditional method with the increas of solution scale...
  • FastPCG

  • Referenced in 4 articles [sw07164]
  • than those of the usual finite element method (FEM). This paper presents an efficient ... procedure. Based on the widely used Successive Over-Relaxation-Preconditioned Conjugate Gradient (SSOR-PCG) scheme ... computational cost is comparable with the traditional method with the increas of solution scale...
  • TorchLight

  • Referenced in 4 articles [sw13534]
  • work, it was observed that the optimal relaxation heuristic h+ has amazing qualities in many ... contrast to earlier disappointing results -- the analysis method has exponential runtime and succeeds only ... results in low-order polynomial time analysis methods, implemented in a tool we call TorchLight ... minima has been proved, TorchLight gives strong success guarantees in 8 domains. Empirically, its analysis...
  • PorousH2M

  • Referenced in 1 article [sw18328]
  • shown that the adaptive relaxed Picard method has salient advantage over the traditional one with ... Newton-Raphson scheme, the Picard method successfully avoids the unphysical `spurious unloading’ phenomenon under...
  • NLCertify

  • Referenced in 4 articles [sw08786]
  • exploits sparse semialgebraic optimization techniques with approximation methods for transcendental functions, as well as formal ... using a hierarchy of semidefinite (SDP) relaxations, via an interface with the external SDPA solver ... code. The NLCertify package solves successfully non-trivial inequalities from the Flyspeck project (essentially tight...
  • MESMER

  • Referenced in 1 article [sw26915]
  • successfully used to analyze and predict nonequilibrium chemical kinetics across a range of intermediate relaxation ... statistical mechanics approaches like contracted basis set methods and nonadiabatic RRKM theory for modeling spin...
  • eLBM

  • Referenced in 2 articles [sw31183]
  • within the framework of the lattice Boltzmann method (LBM) for efficiently simulating two-phase pore ... balance solver is based on the multiple-relaxation-time (MRT) model. The Boltzmann equation ... model over the conventional single-relaxation-time Bhatnagar-Gross-Krook (BGK) model are (I) enhanced ... various types of real rock images. We successfully validate and apply the eLBM on several...
  • BARON

  • Referenced in 361 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • COLAMD

  • Referenced in 33 articles [sw00145]
  • Two codes are discussed, COLAMD and SYMAMD, that...
  • CSDP

  • Referenced in 206 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...