COCONUT
From MaRDI portal
Cited in
(68)- Upper bounding in inner regions for global optimization under inequality constraints
- Numerical Software with Result Verification
- Writing global optimization software
- A reliable affine relaxation method for global optimization
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- An overview of advances in global optimization during 2003--2008
- Error bounds for initial value problems by optimization
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A comparison of complete global optimization solvers
- A review of recent advances in global optimization
- Exclusion regions for optimization problems
- LaGO -- an object oriented library for solving MINLPs
- Interval unions
- Constraint aggregation for rigorous global optimization
- Exclusion regions for parameter-dependent systems of equations
- Adaptive constructive interval disjunction: algorithms and experiments
- Rigorous enclosures of ellipsoids and directed Cholesky factorizations
- Interval Subroutine Library Mission
- Integral approximation of rays and verification of feasibility
- GLOPT
- SLDRIVER
- SLTSTPAK
- UniCalc
- GLOPTLAB
- SOCP
- ICOS
- lp_solve
- LIBOPT
- testenv
- Slatec
- SolvOpt
- INTOPT_90
- COPRIN
- OPAL
- GlobSol
- COPS
- Test Set for IVP Solvers
- Lurupa
- coco_gop_ex
- PSICO
- MPBNGC
- IbexOpt
- Boost Interval Arithmetic
- Algorithm 709
- JGloptLab
- A general framework for convexity analysis in deterministic global optimization
- The optimization test environment
- Complete search in continuous global optimization and constraint satisfaction
- Optimization Test Environment
- Numerica
- Newton
- GAMS Model
- InC++
- Linear and parabolic relaxations for quadratic constraints
- An Optimized Cell BE Special Function Library Generated by Coconut
- Certificates of infeasibility via nonsmooth optimization
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Domain reduction techniques for global NLP and MINLP optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- Constraint propagation on quadratic constraints
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Rigorous filtering using linear relaxations
- Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
- Best practices for comparing optimization algorithms
- A probing algorithm for MINLP with failure prediction by SVM
- Bound constrained interval global optimization in the COCONUT environment
- Benchmarking nonlinear optimization software in technical computing environments
This page was built for software: COCONUT
