• Algorithm 829

  • Referenced in 58 articles [sw04467]
  • functions. Test functions are generated by defining a convex quadratic function systematically distorted by polynomials ... class. Full information about each test function including locations and values of all local minima...
  • CGAL

  • Referenced in 384 articles [sw00118]
  • approximation of ridges and umbilics), alpha shapes, convex hull algorithms ... like points and segments, and perform geometric tests on them. These objects and predicates...
  • PENNON

  • Referenced in 108 articles [sw04336]
  • present generalization of this algorithm to convex NLP-SDP problems, as implemented in PENNON ... constraints. Results of extensive numerical tests and comparison with other optimization codes are presented...
  • SCALCG

  • Referenced in 108 articles [sw08453]
  • conditions it is shown that, for strongly convex functions, the algorithm is global convergent. Preliminary ... consisting of 500 unconstrained optimization test problems, show that this new scaled conjugate gradient algorithm...
  • Couenne

  • Referenced in 68 articles [sw04347]
  • Convex Over- and Under-ENvelopes for Non-linear Estimation) and used it for extensive tests...
  • alphaBB

  • Referenced in 49 articles [sw06249]
  • convex minimization problems. The global optimization method, ffBB, is implemented in C and tested...
  • SPG

  • Referenced in 76 articles [sw00897]
  • projected gradient algorithm for solving large-scale convex-constrained optimization problems. It combines the classical ... onto the feasible set. Some recent numerical tests are reported on very large location problems...
  • ZQPCVX

  • Referenced in 34 articles [sw08459]
  • convex quadratic programming are considered. A pathological example shows that the faster ... unstable, but numerical testing on some difficult problems indicates that both implementations give excellent accuracy ... Fortran subroutine [”ZQPCVX: a Fortran subroutine for convex, quadratic programming”, Report DAMTP/1983/NA17, Dept. Appl. Math...
  • SPGL1

  • Referenced in 196 articles [sw08365]
  • solution. We prove that this curve is convex and continuously differentiable over all points ... Numerical experiments on a comprehensive set of test problems demonstrate that the method scales well...
  • hiertest

  • Referenced in 2 articles [sw19125]
  • package hiertest: Convex Hierarchical Testing of Interactions. Implementation of the convex hierarchical testing (CHT) procedure ... Bien, Simon, and Tibshirani (2015) Convex Hierarchical Testing of Interactions. Annals of Applied Statistics...
  • TAO

  • Referenced in 52 articles [sw10597]
  • conjugate gradient) algorithm for solving bound-constrained convex quadratic problems. Our implementation of the GPCG ... high-performance architectures and has been tested on problems with over 2.5 million variables...
  • BUQO

  • Referenced in 4 articles [sw34653]
  • maximum a posteriori (MAP) estimation is a convex optimization problem. The method is a framework ... under scrutiny by performing a Bayesian hypothesis test that proceeds as follows: first, it postulates ... null hypothesis with high probability. Computing such tests for imaging problems is generally very difficult ... formulate the Bayesian hypothesis test as a convex problem, which we then efficiently solve...
  • PALP

  • Referenced in 70 articles [sw00672]
  • lattice points in the convex hull of a given set of points. In addition, there ... Calabi-Yau varieties. The package is well tested and optimised in speed...
  • TVAL3

  • Referenced in 22 articles [sw08575]
  • Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class ... smooth optimization problems (chiefly but not necessarily convex programs) with a particular structure. The algorithm...
  • 2D polygons

  • Referenced in 1 article [sw11151]
  • extremal points, signed area, simplicity and convexity test, orientation, and point location. The demo includes ... operations on polygons, such as computing a convex partition, and the straight skeleton...
  • CMU-IBM

  • Referenced in 12 articles [sw13495]
  • solving mixed-integer nonlinear programs (MINLP) with convex relaxation. The main objectives of this effort ... other available libraries of test problems...
  • RPSALG

  • Referenced in 9 articles [sw12637]
  • second one requires to solve a non-convex optimization problem involving the parametric constraints ... solver, NSIPS, on a battery of test problems...
  • StatePolytope

  • Referenced in 7 articles [sw07236]
  • bases and convex polytopes, page 14. There is also a function for testing GIT stability...
  • CCA

  • Referenced in 5 articles [sw30994]
  • Moreau envelope, the (generalized) proximal average, the convex hull, the subdifferential, and Rockafellar and Fitzpatrick ... library contains extensive demos, and numerous tests (476 unit tests with a statement coverage...
  • QPsimplex

  • Referenced in 5 articles [sw31751]
  • starts necessary for the efficient solution of convex relaxations repeatedly at the nodes ... algorithms. We test the simplex-based quadratic programming algorithms to solve convex as well...