GlobSol

swMATH6724MaRDI QIDQ18804FDOQ18804

Author name not available (Why is that?)

Described by source

• Global Optimization and Constraint Satisfaction

Cited In (37)

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

This page was built for software: GlobSol