Global optimization in protein docking using clustering, underestimation and semidefinite programming
From MaRDI portal
Publication:5437527
DOI10.1080/00207170701203756zbMath1169.90422OpenAlexW2135796990MaRDI QIDQ5437527
Stephen J. Wright, Julie C. Mitchell, Roummel F. Marcia
Publication date: 21 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207170701203756
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items
Cites Work
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Molecular modeling and simulation. An interdisciplinary guide
- Bilinear separation of two sets in \(n\)-space
- Accurate solution to overdetermined linear equations with errors using \(L_1\) norm minimization
- Convex quadratic approximation
- Iterative convex quadratic approximation for global optimization in protein docking
- Nonconvex piecewise-quadratic underestimation for global minimization
- Convex kernel underestimation of functions with multiple local minima
- Global minimization via piecewise-linear underestimation
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- SDU: A Semidefinite Programming-Based Underestimation Method for Stochastic Global Optimization in Protein Docking
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
