GlobSol
From MaRDI portal
Software:18804
No author found.
Related Items (37)
A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Using Expression Graphs in Optimization Algorithms ⋮ Complete search in continuous global optimization and constraint satisfaction ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Unnamed Item ⋮ Numerical Software with Result Verification ⋮ Numerical Software with Result Verification ⋮ A general framework for convexity analysis in deterministic global optimization ⋮ A review of computation of mathematically rigorous bounds on optima of linear programs ⋮ On smooth reformulations and direct non-smooth computations for minimax problems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Who invented the reverse mode of differentiation? ⋮ Efficient and accurate computation of upper bounds of approximation errors ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems ⋮ Erratum: Validated Linear Relaxations and Preprocessing: Some Experiments ⋮ A reliable affine relaxation method for global optimization ⋮ Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations ⋮ Global optimization ⋮ Efficient interval partitioning for constrained global optimization ⋮ On rigorous upper bounds to a global optimum ⋮ From the Product Example to PDE Adjoints, Algorithmic Differentiation and Its Application (Invited Talk) ⋮ The extrapolated interval global optimization algorithm ⋮ Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces ⋮ Standardized Interval Arithmetic and Interval Arithmetic Used in Libraries ⋮ Hardware support for interval arithmetic ⋮ Blending set and interval arithmetic for maximal reliability ⋮ An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions ⋮ A comparison of complete global optimization solvers ⋮ A framework for existence tests based on the topological degree and homotopy ⋮ Interval computations, rigour and non-rigour in deterministic continuous global optimization ⋮ GlobSol user guide ⋮ Validated constraints solving --- practicalities, pitfalls, and new developments ⋮ Interval methods and contractor-based branch-and-bound procedures for verified parameter identification of quasi-linear cooperative system models ⋮ Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization ⋮ Some observations on exclusion regions in branch and bound algorithms ⋮ Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
This page was built for software: GlobSol
