Conic relaxation approaches for equal deployment problems
From MaRDI portal
(Redirected from Publication:2297663)
Abstract: An important problem in the breeding of livestock, crops, and forest trees is the optimum of selection of genotypes that maximizes genetic gain. The key constraint in the optimal selection is a convex quadratic constraint that ensures genetic diversity, therefore, the optimal selection can be cast as a second-order cone programming (SOCP) problem. Yamashita et al. (2015) exploits the structural sparsity of the quadratic constraints and reduces the computation time drastically while attaining the same optimal solution. This paper is concerned with the special case of equal deployment (ED), in which we solve the optimal selection problem with the constraint that contribution of genotypes must either be a fixed size or zero. This involves a nature of combinatorial optimization, and the ED problem can be described as a mixed-integer SOCP problem. In this paper, we discuss conic relaxation approaches for the ED problem based on LP (linear programming), SOCP, and SDP (semidefinite programming). We analyze theoretical bounds derivedfrom the SDP relaxation approaches using the work of Tseng (2003) and show that the theoretical bounds are not quite sharp for tree breeding problems. We propose a steepest-ascent method that combines the solution obtained from the conic relaxation problems with a concept from discrete convex optimization in order to acquire an approximate solution for the ED problem in a practical time. From numerical tests, we observed that among the LP, SOCP, and SDP relaxation problems, SOCP gave a suitable solution from the viewpoints of the optimal values and the computation time. The steepest-ascent method starting from the SOCP solution provides high-quality solutions much faster than an existing method that has been widely used for the optimal selection problems and a branch-and-bound method.
Recommendations
- An efficient second-order cone programming approach for optimal selection in tree breeding
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Second-order cone programming
- Polyhedral-based methods for mixed-integer SOCP in tree breeding
Cites work
- A Simple Method for Computing the Inverse of a Numerator Relationship Matrix Used in Prediction of Breeding Values
- Discrete Convex Analysis
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- On Polyhedral Approximations of the Second-Order Cone
- On Steepest Descent Algorithms for Discrete Convex Functions
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Semidefinite optimization
- Subgradient based outer approximation for mixed integer second order cone programming
Cited in
(5)- An efficient second-order cone programming approach for optimal selection in tree breeding
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
- Optimal Diversity‐Dependent Contributions of Genotypes to Mixtures
- Polyhedral-based methods for mixed-integer SOCP in tree breeding
This page was built for publication: Conic relaxation approaches for equal deployment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297663)
