Mirjam Dür

Fast and versatile sequence-independent protein docking for nanomaterials design using RPXDock

Semidefinite programming relaxations for semialgebraic problems

On the computational complexity of membership problems for the completely positive cone and its dual

Approximation of the Stability Number of a Graph via Copositive Programming

Fractional Programming for Communication Systems—Part I: Power Control and Beamforming

Analysis of copositive optimization based linear programming bounds on standard quadratic optimization

Interior-point methods for optimization

Multicell MIMO Communications Relying on Intelligent Reflecting Surfaces

Optimisation of building shape and orientation for better energy efficient architecture

DC Programming: Overview

Distance learning techniques for ontology similarity measuring and ontology mapping

Energy Efficiency in Wireless Networks via Fractional Programming Theory

Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication

Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning

Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency

Solving Sum of Ratios Fractional Programs via Concave Minimization

Robust and Secure Wireless Communications via Intelligent Reflecting Surfaces

Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning

Most Tensor Problems Are NP-Hard

An investigation of the impact of building orientation on energy consumption in a domestic building using emerging BIM (Building Information Modelling)

Probabilistic subproblem selection in branch-and-bound algorithms

Packing solar cells on a roof

On Copositive Programming and Standard Quadratic Optimization Problems

An improved algorithm to test copositivity

An Adaptive Linear Approximation Algorithm for Copositive Programs

Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices

Solving sum-of-ratios fractional programs using efficient points

Necessary and Sufficient Global Optimality Conditions for Convex Maximization Revisited