Pages that link to "Item:Q1290652"
From MaRDI portal
The following pages link to On proving existence of feasible points in equality constrained optimization problems (Q1290652):
Displaying 15 items.
- Linear and parabolic relaxations for quadratic constraints (Q300753) (← links)
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Numerical solution for bounding feasible point sets (Q1398432) (← links)
- A continuous location model for siting a non-noxious undesirable facility within a geographical region (Q1969855) (← links)
- Rigorous verification of feasibility (Q2018466) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- On rigorous upper bounds to a global optimum (Q2250091) (← links)
- Some observations on exclusion regions in branch and bound algorithms (Q2349518) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- Mathematically rigorous global optimization in floating-point arithmetic (Q4685569) (← links)
- Constraint aggregation for rigorous global optimization (Q5962722) (← links)
