SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY
DOI10.1142/S0217595914500225zbMath1302.90112MaRDI QIDQ2931718
Publication date: 26 November 2014
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
integer programmingsemidefinite programmingcombinatorial optimizationcomputational biologyprotein foldingbinary quadratic programmingprotein similaritycontact map overlaprotamer assignmentdoubly non-negative relaxation
Semidefinite programming (90C22) Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Copositive optimization -- recent developments and applications
- Handbook on semidefinite, conic and polynomial optimization
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Selected combinatorial problems of computational biology
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Experiments in quadratic 0-1 programming
- A simple recipe for concise mixed 0-1 linearizations
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Approximation of the Stability Number of a Graph via Copositive Programming
- Copositive Programming
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Opportunities for Combinatorial Optimization in Computational Biology
- A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
- Matrix Relaxations in Combinatorial Optimization
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Lagrange Multipliers and Optimality
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Some NP-complete problems in quadratic and nonlinear programming
- Approximate graph coloring by semidefinite programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Novel formulations for the sequence selection problem in de novo protein design with flexible templates
This page was built for publication: SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY