COCONUT

swMATH4760MaRDI QIDQ16928FDOQ16928

Author name not available (Why is that?)

Described by source

• Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods

Cited In (37)

• Exclusion regions for optimization problems
• An Optimized Cell BE Special Function Library Generated by Coconut
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• The optimization test environment
• Benchmarking nonlinear optimization software in technical computing environments
• Integral approximation of rays and verification of feasibility
• A probing algorithm for MINLP with failure prediction by SVM
• A review of recent advances in global optimization
• Interval unions
• Complete search in continuous global optimization and constraint satisfaction
• Linear and parabolic relaxations for quadratic constraints
• Best practices for comparing optimization algorithms
• An overview of advances in global optimization during 2003--2008
• Rigorous filtering using linear relaxations
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Constraint propagation on quadratic constraints
• Bound constrained interval global optimization in the COCONUT environment
• Upper bounding in inner regions for global optimization under inequality constraints
• A reliable affine relaxation method for global optimization
• Error bounds for initial value problems by optimization
• Constraint aggregation for rigorous global optimization
• Interval Subroutine Library Mission
• A comparison of complete global optimization solvers
• Exclusion regions for parameter-dependent systems of equations
• Adaptive constructive interval disjunction: algorithms and experiments
• Certificates of infeasibility via nonsmooth optimization
• Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
• A general framework for convexity analysis in deterministic global optimization
• Minotaur: a mixed-integer nonlinear optimization toolkit
• Rigorous enclosures of ellipsoids and directed Cholesky factorizations
• Writing global optimization software
• Domain reduction techniques for global NLP and MINLP optimization
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
• LaGO -- an object oriented library for solving MINLPs
• Numerical Software with Result Verification
• Convexity and concavity detection in computational graphs: tree walks for convexity assessment
• Algorithmic differentiation techniques for global optimization in the COCONUT environment

This page was built for software: COCONUT