Algorithmic differentiation techniques for global optimization in the COCONUT environment
From MaRDI portal
Publication:2885482
Recommendations
- Numerical Software with Result Verification
- Bound constrained interval global optimization in the COCONUT environment
- Global optimization: A new variant of the Alienor method
- scientific article; zbMATH DE number 494358
- scientific article; zbMATH DE number 1279086
- Implementation of global optimization and comparison with several deviation integral algorithms
- Comparison of several stochastic and deterministic derivative-free global optimization algorithms
- Publication:4727308
- scientific article; zbMATH DE number 3978852
- A new taxonomy of global optimization algorithms
Cites work
- scientific article; zbMATH DE number 761488 (Why is no real title available?)
- scientific article; zbMATH DE number 854122 (Why is no real title available?)
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Algorithm 755: ADOL-C
- Applying interval arithmetic to real, integer, and boolean constraints
- BARON: A general purpose global optimization software package
- Bound constrained interval global optimization in the COCONUT environment
- Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constraint propagation on quadratic constraints
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Evaluating Derivatives
- Exclusion Regions for Systems of Equations
- Exclusion regions for optimization problems
- Expansion and estimation of the range of nonlinear functions
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Interval Slopes for Rational Functions and Associated Centered Forms
- Interval analysis on directed acyclic graphs for global optimization
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Introduction to Numerical Analysis
- Numerical Software with Result Verification
- PROFIL/BIAS - A fast interval library
- Rigorous enclosures of ellipsoids and directed Cholesky factorizations
- Rigorous global search: continuous problems
- The cluster problem in multivariate global optimization
- Use of interval slopes for the irrational part of factorable functions
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
Cited in
(8)- Subdomain separability in global optimization
- Exclusion regions for optimization problems
- Constraint aggregation for rigorous global optimization
- Exclusion regions for parameter-dependent systems of equations
- Linear and parabolic relaxations for quadratic constraints
- Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
- Best practices for comparing optimization algorithms
- Bound constrained interval global optimization in the COCONUT environment
This page was built for publication: Algorithmic differentiation techniques for global optimization in the COCONUT environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885482)
