A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and
Chan in An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image …
Chan in An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image …
Residential load control: Distributed scheduling and convergence with lost AMI messages
N Gatsis, GB Giannakis - IEEE Transactions on Smart Grid, 2012 - ieeexplore.ieee.org
This paper deals with load control in a multiple-residence setup. The utility company adopts
a cost function representing the cost of providing energy to end-users. Each residential end …
a cost function representing the cost of providing energy to end-users. Each residential end …
Online primal-dual methods with measurement feedback for time-varying convex optimization
This paper addresses the design and analysis of feedback-based online algorithms to
control systems or networked systems based on performance objectives and engineering …
control systems or networked systems based on performance objectives and engineering …
Convergence of approximate and incremental subgradient methods for convex optimization
KC Kiwiel - SIAM Journal on Optimization, 2004 - SIAM
We present a unified convergence framework for approximate subgradient methods that
covers various stepsize rules (including both diminishing and nonvanishing stepsizes) …
covers various stepsize rules (including both diminishing and nonvanishing stepsizes) …
Photovoltaic inverter controllers seeking AC optimal power flow solutions
This paper considers future distribution networks featuring inverter-interfaced photovoltaic
(PV) systems, and addresses the synthesis of feedback controllers that seek real-and …
(PV) systems, and addresses the synthesis of feedback controllers that seek real-and …
On the convergence of primal–dual hybrid gradient algorithms for total variation image restoration
S Bonettini, V Ruggiero - Journal of Mathematical Imaging and Vision, 2012 - Springer
In this paper we establish the convergence of a general primal–dual method for nonsmooth
convex optimization problems whose structure is typical in the imaging framework, as, for …
convex optimization problems whose structure is typical in the imaging framework, as, for …
Recent advances in variable metric first-order methods
Minimization problems often occur in modeling phenomena dealing with real-life
applications that nowadays handle large-scale data and require real-time solutions. For …
applications that nowadays handle large-scale data and require real-time solutions. For …
Rethinking biased estimation: Improving maximum likelihood and the Cramér–Rao bound
YC Eldar - Foundations and Trends® in Signal Processing, 2008 - nowpublishers.com
One of the prime goals of statistical estimation theory is the development of performance
bounds when estimating parameters of interest in a given model, as well as constructing …
bounds when estimating parameters of interest in a given model, as well as constructing …
Uniformly improving the Cramér-Rao bound and maximum-likelihood estimation
YC Eldar - IEEE Transactions on Signal Processing, 2006 - ieeexplore.ieee.org
An important aspect of estimation theory is characterizing the best achievable performance
in a given estimation problem, as well as determining estimators that achieve the optimal …
in a given estimation problem, as well as determining estimators that achieve the optimal …
Inexact subgradient methods for quasi-convex optimization problems
In this paper, we consider a generic inexact subgradient algorithm to solve a
nondifferentiable quasi-convex constrained optimization problem. The inexactness stems …
nondifferentiable quasi-convex constrained optimization problem. The inexactness stems …