Global optimization in protein docking using clustering, underestimation and semidefinite programming
From MaRDI portal
Recommendations
- SDU: A Semidefinite Programming-Based Underestimation Method for Stochastic Global Optimization in Protein Docking
- scientific article; zbMATH DE number 1301595
- Global optimization of protein-peptide docking by a filling function method
- Iterative convex quadratic approximation for global optimization in protein docking
- Global stochastic optimization in hierarchical modeling of ligand/protein binding profiles
- Deterministic global optimization for protein structure prediction
- scientific article; zbMATH DE number 841189
- scientific article; zbMATH DE number 841183
- Global optimization in computational chemistry: protein folding
- scientific article; zbMATH DE number 1424374
Cites work
- Accurate solution to overdetermined linear equations with errors using \(L_1\) norm minimization
- An Improved Algorithm for Discrete l₁ Linear Approximation
- An Interior-Point Method for Semidefinite Programming
- Bilinear separation of two sets in n-space
- Convex kernel underestimation of functions with multiple local minima
- Convex quadratic approximation
- Global minimization via piecewise-linear underestimation
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Iterative convex quadratic approximation for global optimization in protein docking
- Molecular modeling and simulation. An interdisciplinary guide
- Nonconvex piecewise-quadratic underestimation for global minimization
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- SDU: A Semidefinite Programming-Based Underestimation Method for Stochastic Global Optimization in Protein Docking
- Semidefinite Programming
- Solving semidefinite-quadratic-linear programs using SDPT3
Cited in
(4)- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues
- Iterative convex quadratic approximation for global optimization in protein docking
- Global optimality conditions for cubic minimization problems with cubic constraints
- Multi-funnel optimization using Gaussian underestimation
This page was built for publication: Global optimization in protein docking using clustering, underestimation and semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437527)
