Pages that link to "Item:Q1368739"
From MaRDI portal
The following pages link to A reduced space branch and bound algorithm for global optimization. (Q1368739):
Displaying 17 items.
- Convergence-order analysis of branch-and-bound algorithms for constrained problems (Q1668796) (← links)
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (Q1685576) (← links)
- Deterministic global optimization with artificial neural networks embedded (Q1730780) (← links)
- Decision-dependent probabilities in stochastic programs with recourse (Q1989722) (← links)
- A reduced-space line-search method for unconstrained optimization via random descent directions (Q2007776) (← links)
- Deterministic global optimization with Gaussian processes embedded (Q2062323) (← links)
- Obey validity limits of data-driven models through topological data analysis and one-class classification (Q2147924) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- A scalable global optimization algorithm for stochastic nonlinear programs (Q2274886) (← links)
- A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
- Linearity embedded in nonconvex programs (Q2583177) (← links)
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization (Q2689856) (← links)
- Convex and concave relaxations of implicit functions (Q2943829) (← links)
- Comparison of deterministic and stochastic approaches to global optimization (Q3025042) (← links)
- Mathematically Rigorous Global Optimization and Fuzzy Optimization (Q5153504) (← links)
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707) (← links)
- Comparison of MINLP formulations for global superstructure optimization (Q6173771) (← links)
