74,594 research outputs found
From error bounds to the complexity of first-order descent methods for convex functions
This paper shows that error bounds can be used as effective tools for
deriving complexity results for first-order descent methods in convex
minimization. In a first stage, this objective led us to revisit the interplay
between error bounds and the Kurdyka-\L ojasiewicz (KL) inequality. One can
show the equivalence between the two concepts for convex functions having a
moderately flat profile near the set of minimizers (as those of functions with
H\"olderian growth). A counterexample shows that the equivalence is no longer
true for extremely flat functions. This fact reveals the relevance of an
approach based on KL inequality. In a second stage, we show how KL inequalities
can in turn be employed to compute new complexity bounds for a wealth of
descent methods for convex problems. Our approach is completely original and
makes use of a one-dimensional worst-case proximal sequence in the spirit of
the famous majorant method of Kantorovich. Our result applies to a very simple
abstract scheme that covers a wide class of descent methods. As a byproduct of
our study, we also provide new results for the globalization of KL inequalities
in the convex framework.
Our main results inaugurate a simple methodology: derive an error bound,
compute the desingularizing function whenever possible, identify essential
constants in the descent method and finally compute the complexity using the
one-dimensional worst case proximal sequence. Our method is illustrated through
projection methods for feasibility problems, and through the famous iterative
shrinkage thresholding algorithm (ISTA), for which we show that the complexity
bound is of the form where the constituents of the bound only depend
on error bound constants obtained for an arbitrary least squares objective with
regularization
Robust filtering for bilinear uncertain stochastic discrete-time systems
Copyright [2002] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper deals with the robust filtering problem for uncertain bilinear stochastic discrete-time systems with estimation error variance constraints. The uncertainties are allowed to be norm-bounded and enter into both the state and measurement matrices. We focus on the design of linear filters, such that for all admissible parameter uncertainties, the error state of the bilinear stochastic system is mean square bounded, and the steady-state variance of the estimation error of each state is not more than the individual prespecified value. It is shown that the design of the robust filters can be carried out by solving some algebraic quadratic matrix inequalities. In particular, we establish both the existence conditions and the explicit expression of desired robust filters. A numerical example is included to show the applicability of the present method
Recommended from our members
Robust H2/Hâ-state estimation for systems with error variance constraints: the continuous-time case
Copyright [1999] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.The paper is concerned with the state estimator design problem for perturbed linear continuous-time systems with Hâ norm and variance constraints. The perturbation is assumed to be time-invariant and norm-bounded and enters into both the state and measurement matrices. The problem we address is to design a linear state estimator such that, for all admissible measurable perturbations, the variance of the estimation error of each state is not more than the individual prespecified value, and the transfer function from disturbances to error state outputs satisfies the prespecified Hâ norm upper bound constraint, simultaneously. Existence conditions of the desired estimators are derived in terms of Riccati-type matrix inequalities, and the analytical expression of these estimators is also presented. A numerical example is provided to show the directness and effectiveness of the proposed design approac
Recommended from our members
Uncertainty modelling in power system state estimation
A method for uncertainty analysis in power system state estimation is proposed. The two-step method uses static weighted least-squares analysis to compute 'point' state estimates. Linear programming is then employed to obtain the upper and lower bounds of the uncertainty interval. It is shown that the method can provide useful additional information for both metered and nonmetered elements of the system. The effects of network parameter errors are also studied. For illustrative purposed, the proposed method is tested using the six-bus and IEEE 30-bus standard systems. Results show that the proposed method is an accurate and reliable tool for estimating the uncertainty bounds in power system state estimation
- âŠ