Optimization problems involving matrix multiplication with applications in materials science and biology

DOI10.1080/0305215X.2021.1900156MaRDI QIDQ6094500zbMATH OpenOpenAlexWikidataFDO

Authors Burak Kocuk

Publication date 10 October 2023

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2003.04658

zbMATH Keywords

applications in biologyapplications in materials scienceglobal optimizationmixed-integer linear programmingmixed-integer quadratically constrained quadratic programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

Abstract: We consider optimization problems involving the multiplication of variable matrices to be selected from a given family, which might be a discrete set, a continuous set or a combination of both. Such nonlinear, and possibly discrete, optimization problems arise in applications from biology and material science among others, and are known to be NP-Hard for a special case of interest. We analyze the underlying structure of such optimization problems for two particular applications and, depending on the matrix family, obtain compact-size mixed-integer linear or quadratically constrained quadratic programming reformulations that can be solved via commercial solvers. Finally, we present the results of our computational experiments, which demonstrate the success of our approach compared to heuristic and enumeration methods predominant in the literature.

Recommendations

• Matrix, Numerical, and Optimization Methods in Science and Engineering
• Optimization problems in extension matrices
• scientific article; zbMATH DE number 3896267
• Constrained matrix optimization with applications
• Optimization with binet matrices
• Matrix mathematical programming problems
• Optimization problems with orthogonal matrix constraints
• Mathematical strategies for design optimization of multiphase materials
• Matrix relaxations in combinatorial optimization
• Multigrid optimization in applications

Cites work

• A simple stochastic gene substitution model
• Antibiotics time machines are hard to build
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Disjunctive Programming
• scientific article; zbMATH DE number 3155071 (Why is no real title available?)
• Optimal Switching Sequence for Switched Linear Systems
• Rational design of antibiotic treatment plans: a treatment strategy for managing evolution and reversing resistance
• The mortality problem for matrices of low dimensions
• When is a pair of matrices mortal?

Cited in

(2)

• A stochastic programming approach to the antibiotics time machine problem
• Risk-averse antibiotics time machine problem

This page was built for publication: Optimization problems involving matrix multiplication with applications in materials science and biology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094500)