• LOQO

  • Referenced in 197 articles [sw02212]
  • LOQO, which implements a primal-dual interior-point method for general nonlinear programming. We focus...
  • GLPK

  • Referenced in 149 articles [sw04560]
  • dual simplex methods, primal-dual interior-point method, branch-and-cut method, translator...
  • SDPA

  • Referenced in 154 articles [sw03275]
  • SDPs based on the primal-dual interior-point method. It fully exploits the sparsity...
  • OSL

  • Referenced in 97 articles [sw09295]
  • Implementing interior point linear programming methods in the Optimization Subroutine Library. This ... paper discusses the implementation of interior point (barrier) methods for linear programming within the framework ... class of methods uses quite different computational kernels than the traditional simplex method. In particular ... newer IBM machine architectural features. In particular, interior methods can benefit greatly from...
  • ipfilter

  • Referenced in 63 articles [sw04778]
  • globally convergent primal-dual interior-point filter method for nonlinear programming The paper proposes ... Leyffer to globalize the primal-dual interior-point method for nonlinear optimization, avoiding...
  • LIPSOL

  • Referenced in 76 articles [sw04712]
  • package for solving linear programs by interior-Point methods. It requires Matlab version...
  • SDPpack

  • Referenced in 51 articles [sw04333]
  • Semidefinite programs are best solved by interior-point methods, the class of methods introduced ... implemented a state-of-the-art interior-point method to solve semidefinite programs efficiently...
  • HOPDM

  • Referenced in 70 articles [sw04342]
  • implementation of the infeasible primal-dual interior point method. It uses multiple centrality correctors; their...
  • KORBX

  • Referenced in 55 articles [sw04341]
  • algorithms which are variations of the interior point method of Narendra Karmarkar. The primal, dual...
  • PDNET

  • Referenced in 38 articles [sw04752]
  • truncated primal-infeasible dual-feasible network interior point method The authors introduce the truncated primal ... infeasible dual-feasible interior point algorithm for linear programming and describe an implementation of this ... implementation, a preconditioned conjugate gradient method is used as the iterative solver. The details...
  • OOQP

  • Referenced in 31 articles [sw04743]
  • package, based on a primal-dual interior-point method, for solving convex quadratic programming problems...
  • OOPS

  • Referenced in 30 articles [sw10470]
  • object-oriented library for parallel interior-point methods are addressed. The solver can easily exploit...
  • DSDP5

  • Referenced in 26 articles [sw04411]
  • relatively low memory requirements for an interior-point method, sparse and low-rank data structures...
  • COLAMD

  • Referenced in 26 articles [sw00145]
  • arise in least-squares problems and interior point methods for linear programming problems...
  • SQPlab

  • Referenced in 113 articles [sw05161]
  • method. If the rule above does not apply, a nonlinear interior point algorithm...
  • ECOS

  • Referenced in 19 articles [sw12123]
  • implemented solution algorithm is an interior-point method that is an efficient standard algorithm...
  • L1-MAGIC

  • Referenced in 18 articles [sw12430]
  • algorithms are based on standard interior-point methods, and are suitable for large-scale problems...
  • OPT++

  • Referenced in 16 articles [sw05203]
  • classic Newton methods, a nonlinear interior-point method, parallel direct search, generating set search...
  • EVPI

  • Referenced in 17 articles [sw02644]
  • future uncertainty. There are a variety of methods for solving the deterministic equivalent forms ... dynamic problems, including the simplex and interior-point methods and nested Benders decomposition, which decomposes...
  • SDPARA

  • Referenced in 17 articles [sw07707]
  • software based on the primal–dual interior-point method for solving SDPs (SemiDefinite Programs...