An efficient and safe framework for solving optimization problems
From MaRDI portal
Recommendations
Cites work
- A comparative performance evaluation of 27 nonlinear programming codes
- Complete search in continuous global optimization and constraint satisfaction
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 1440918 (Why is no real title available?)
- Rigorous global search: continuous problems
- Safe and tight linear estimators for global optimization
- Safe bounds in linear and mixed-integer linear programming
- The convergence rate of the sandwich algorithm for approximating convex functions
- Validated Linear Relaxations and Preprocessing: Some Experiments
Cited in
(14)- A certified branch \& bound approach for reliability-based optimization problems
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Safe and tight linear estimators for global optimization
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Example Guided Synthesis of Linear Approximations for Neural Network Verification
- Hybridizing two linear relaxation techniques in interval-based solvers
- Global solution of quadratic problems using interval methods and convex relaxations
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
This page was built for publication: An efficient and safe framework for solving optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861905)
