output
19952020
most citedTheory and phenomenology of two-Higgs-doublet models

2.6k citations

Showing math.OCShow all

9 papers · 1 filter

math.OC2019★ 36 cited

An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem

Camila P. S. Tautenhain, Ana Paula Barbosa-Povoa, Bruna Mota +1

Sustainable Supply Chain (SSC) management aims at integrating economic, environmental and social goals to assist in the long-term planning of a company and its supply chains. There…

math.OC2015★ 193 cited

Robust Collaborative Nonnegative Matrix Factorization For Hyperspectral Unmixing (R-CoNMF)

Jun Li, Jose M. Bioucas-Dias, Antonio Plaza +1

The recently introduced collaborative nonnegative matrix factorization (CoNMF) algorithm was conceived to simultaneously estimate the number of endmembers, the mixing matrix, and t…

math.OC2013★ 112 cited

Distributed Optimization With Local Domains: Applications in MPC and Network Flows

João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar +1

In this paper we consider a network with nodes, where each node has exclusive access to a local cost function. Our contribution is a communication-efficient distributed algorit…

math.OC2012★ 375 cited

D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization

João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar +1

We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnecte…

math.OC2010★ 1 cited

Robust Simultaneous Localization of Nodes and Targets in Sensor Networks Using Range-Only Measurements

Pınar Oğuz-Ekim, João Gomes, João Xavier +1

Simultaneous localization and tracking (SLAT) in sensor networks aims to determine the positions of sensor nodes and a moving target in a network, given incomplete and inaccurate r…

math.OC2010★ 221 cited

Distributed Basis Pursuit

João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar +1

We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least L1-norm solution of the underdetermined linear system Ax = b and is u…

math.OC2009★ 32 cited

A Fast Algorithm for the Constrained Formulation of Compressive Image Reconstruction and Other Linear Inverse Problems

Manya V. Afonso, Jose M. Bioucas-Dias, Mario A. T. Figueiredo

Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrai…

math.OC2009★ 30 cited

Fast Frame-Based Image Deconvolution Using Variable Splitting and Constrained Optimization

Mario A. T. Figueiredo, Jose M. Bioucas-Dias, Manya V. Afonso

We propose a new fast algorithm for solving one of the standard formulations of frame-based image deconvolution: an unconstrained optimization problem, involving an data-f…

math.OC2009★ 472 cited

A Variable Splitting Augmented Lagrangian Approach to Linear Spectral Unmixing

Jose Bioucas-Dias

This paper presents a new linear hyperspectral unmixing method of the minimum volume class, termed \emph{simplex identification via split augmented Lagrangian} (SISAL). Following C…