Pages that link to "Item:Q506441"
From MaRDI portal
The following pages link to Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441):
Displaying 8 items.
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
- Solutions and optimality criteria to box constrained nonconvex minimization problems (Q2469802) (← links)
- Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization (Q6074062) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)