GlobSol
From MaRDI portal
Cited in
(59)- Efficient and accurate computation of upper bounds of approximation errors
- A framework for existence tests based on the topological degree and homotopy
- From the Product Example to PDE Adjoints, Algorithmic Differentiation and Its Application (Invited Talk)
- A reliable affine relaxation method for global optimization
- A hybrid LP/NLP paradigm for global optimization relaxations
- On rigorous upper bounds to a global optimum
- Some observations on exclusion regions in branch and bound algorithms
- A comparison of complete global optimization solvers
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Hardware support for interval arithmetic
- Efficient interval partitioning for constrained global optimization
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- Validated constraints solving --- practicalities, pitfalls, and new developments
- Rigorous enclosures of ellipsoids and directed Cholesky factorizations
- Blending set and interval arithmetic for maximal reliability
- GlobSol user guide
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Using expression graphs in optimization algorithms
- Global optimization
- ACETAF
- GLOPT
- INTBIS
- ICOS
- Slatec
- INTERVAL_ARITHMETIC
- INTOPT_90
- COCONUT
- Easyval
- SpecialValue
- DrAmpl
- Cosy
- Lurupa
- IOSO
- coco_gop_ex
- SONIC
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- A general framework for convexity analysis in deterministic global optimization
- On smooth reformulations and direct non-smooth computations for minimax problems
- Complete search in continuous global optimization and constraint satisfaction
- Numerica
- PrincetonLib
- IBMLib
- Globalizer
- RabbitMQ
- Numerical Software with Result Verification
- Numerical Software with Result Verification
- ValidatedNumerics.jl
- Domain reduction techniques for global NLP and MINLP optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Standardized interval arithmetic and interval arithmetic used in libraries
- Erratum: Validated Linear Relaxations and Preprocessing: Some Experiments
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- scientific article; zbMATH DE number 1440902 (Why is no real title available?)
- Interval methods and contractor-based branch-and-bound procedures for verified parameter identification of quasi-linear cooperative system models
- Interval methods for solving nonlinear constraint satisfaction, optimization and similar problems. From inequalities systems to game solutions
- Who invented the reverse mode of differentiation?
- The extrapolated interval global optimization algorithm
This page was built for software: GlobSol
