output
20122022
most citedFast Reconstruction of Compact Context-Specific Metabolic Network Models

289 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing math.OCShow all

8 papers · 1 filter

math.OC2018★ 75 cited

Continuous time Gaussian process dynamical models in gene regulatory network inference

Atte Aalto, Lauri Viitasaari, Pauliina Ilmonen +2

One of the focus areas of modern scientific research is to reveal mysteries related to genes and their interactions. The dynamic interactions between genes can be encoded into a ge…

math.OC2017★ 1 cited

Finite-time attitude synchronization with distributed discontinuous protocols

Jieqiang Wei, Silun Zhang, Antonio Adaldo +3

The finite-time attitude synchronization problem is considered in this paper, where the rotation of each rigid body is expressed using the axis-angle representation. Two discontinu…

math.OC2017★ 21 cited

Distributed methods for synchronization of orthogonal matrices over graphs

Johan Thunberg, Florian Bernard, Jorge Goncalves

This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equ…

math.OC2016

Almost global consensus on the n-sphere

Johan Markdahl, Johan Thunberg, Jorge Goncalves

This paper establishes novel results regarding the global convergence properties of a large class of consensus protocols for multi-agent systems that evolve in continuous time on t…

math.OC2015★ 82 cited

Accelerating the DC algorithm for smooth functions

Francisco J. Aragón Artacho, Ronan M. T. Fleming, Phan T. Vuong

We introduce two new algorithms to minimise smooth difference of convex (DC) functions that accelerate the convergence of the classical DC algorithm (DCA). We prove that the point…

math.OC2013★ 38 cited

Douglas-Rachford Feasibility Methods for Matrix Completion Problems

Francisco J. Aragón Artacho, Jonathan M. Borwein, Matthew K. Tam

In this paper we give general recommendations for successful application of the Douglas-Rachford reflection method to convex and non-convex real matrix-completion problems. These g…

math.OC2013★ 80 cited

Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems

Francisco J. Aragón Artacho, Jonathan M. Borwein, Matthew K. Tam

We discuss recent positive experiences applying convex feasibility algorithms of Douglas--Rachford type to highly combinatorial and far from convex problems.

math.OC2012★ 2 cited

NP-hardness of polytope M-matrix testing and related problems

Nikos Vlassis

In this note we prove NP-hardness of the following problem: Given a set of matrices, is there a convex combination of those that is a nonsingular M-matrix? Via known characterizati…