Pages that link to "Item:Q2355020"
From MaRDI portal
The following pages link to Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020):
Displaying 15 items.
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems (Q2010090) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← links)
- A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
- On rigorous upper bounds to a global optimum (Q2250091) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems (Q6622755) (← links)
- A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)
