Pages that link to "Item:Q3563904"
From MaRDI portal
The following pages link to An Ellipsoidal Branch and Bound Algorithm for Global Optimization (Q3563904):
Displaying 12 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes (Q474386) (← links)
- Target-oriented branch and bound method for global optimization (Q1422887) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems (Q2253403) (← links)
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions (Q2393063) (← links)
- Circumscribed ellipsoid algorithm for fixed-point problems (Q3015053) (← links)
- Globally optimal bounding ellipsoid algorithm for parameter estimation using artificial neural networks (Q3366313) (← links)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
- (Q5256993) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
