Pages that link to "Item:Q2490366"
From MaRDI portal
The following pages link to Iterative convex quadratic approximation for global optimization in protein docking (Q2490366):
Displaying 7 items.
- Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
- Multi-funnel optimization using Gaussian underestimation (Q946340) (← links)
- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues (Q2433931) (← links)
- Unified global optimality conditions for smooth minimization problems with mixed variables (Q3598042) (← links)
- Global optimality of quadratic minimization over symmetric polytopes (Q5426965) (← links)
- Global optimization in protein docking using clustering, underestimation and semidefinite programming (Q5437527) (← links)
