Iterative convex quadratic approximation for global optimization in protein docking
DOI10.1007/S10589-005-4799-4zbMATH Open1125.90396OpenAlexW1991894478MaRDI QIDQ2490366FDOQ2490366
Roummel F. Marcia, Julie C. Mitchell, J. B. Rosen
Publication date: 2 May 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-4799-4
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
Quadratic programming (90C20) Methods of successive quadratic programming type (90C55) Applications of mathematical programming (90C90)
Cites Work
Cited In (7)
- 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 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
Uses Software
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)
