Iterative convex quadratic approximation for global optimization in protein docking
From MaRDI portal
Publication:2490366
Recommendations
- Global optimization in protein docking using clustering, underestimation and semidefinite programming
- Multi-funnel optimization using Gaussian underestimation
- Nonconvex piecewise-quadratic underestimation for global minimization
- Global minimization and parameter estimation in computational biology.
- scientific article; zbMATH DE number 1101487
Cites work
Cited in
(8)- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Unified global optimality conditions for smooth minimization problems with mixed variables
- Global optimization in protein docking using clustering, underestimation and semidefinite programming
- Global optimality conditions for cubic minimization problems with cubic constraints
- Global optimization of protein-peptide docking by a filling function method
- Global optimality of quadratic minimization over symmetric polytopes
- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues
- Multi-funnel optimization using Gaussian underestimation
This page was built for publication: Iterative convex quadratic approximation for global optimization in protein docking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490366)