Pages that link to "Item:Q861905"
From MaRDI portal
The following pages link to An efficient and safe framework for solving optimization problems (Q861905):
Displaying 10 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- A certified branch \& bound approach for reliability-based optimization problems (Q1679494) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- Safe and tight linear estimators for global optimization (Q1774166) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
- Example Guided Synthesis of Linear Approximations for Neural Network Verification (Q6487316) (← links)
