The following pages link to COCONUT (Q16928):
Displaying 37 items.
- Linear and parabolic relaxations for quadratic constraints (Q300753) (← links)
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- Bound constrained interval global optimization in the COCONUT environment (Q475813) (← links)
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Constraint propagation on quadratic constraints (Q606897) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Error bounds for initial value problems by optimization (Q889871) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Certificates of infeasibility via nonsmooth optimization (Q1675645) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- Integral approximation of rays and verification of feasibility (Q1826440) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- Exclusion regions for parameter-dependent systems of equations (Q2052383) (← links)
- Exclusion regions for optimization problems (Q2250096) (← links)
- Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization (Q2250109) (← links)
- The optimization test environment (Q2357211) (← links)
- Interval unions (Q2359762) (← links)
- A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
- Algorithmic differentiation techniques for global optimization in the COCONUT environment (Q2885482) (← links)
- Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment (Q2899035) (← links)
- A Probing Algorithm for MINLP with Failure Prediction by SVM (Q3003284) (← links)
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations (Q3008248) (← links)
- An Optimized Cell BE Special Function Library Generated by Coconut (Q4974923) (← links)
- Complete search in continuous global optimization and constraint satisfaction (Q5292941) (← links)
- Interval Subroutine Library Mission (Q5302763) (← links)
- Numerical Software with Result Verification (Q5308355) (← links)
- (Q5324204) (← links)
- (Q5492526) (← links)
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707) (← links)
- Global Optimization and Constraint Satisfaction (Q5897039) (← links)
- Constraint aggregation for rigorous global optimization (Q5962722) (← links)
