Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCharacterization of the norm-based robust solutions in vector optimization
102
0
0.0
(
0
)
Added by
Majid Soleimani-damaneh Dr.
Publication date
2019
fields
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we study the norm-based robust (efficient) solutions of a Vector Optimization Problem (VOP). We define two kinds of non-ascent directions in terms of Clarkes generalized gradient and characterize norm-based robustness by means of the newly-defined directions. This is done under a basic Constraint Qualification (CQ). We extend the provided characterization to VOPs with conic constraints. Moreover, we derive a necessary condition for norm-based robustness utilizing a nonsmooth gap function.
rate research
Read More
In this paper, we consider the problem of verifying safety constraint satisfaction for single-input single-output systems with uncertain transfer function coefficients. We propose a new type of barrier function based on a vector norm. This type of barrier function has a measurable upper bound without full state availability. An identifier-based estimator allows an exact bound for the uncertainty-based component of the barrier function estimate. Assuming that the system is safe initially allows an exponentially decreasing bound on the error due to the estimator transient. Barrier function and estimator synthesis is proposed as two convex sub-problems, exploiting linear matrix inequalities. The barrier function controller combination is then used to construct a safety backup controller. And we demonstrate the system in a simulation of a 1 degree-of-freedom human-exoskeleton interaction.
Optimization-based state estimation is useful for nonlinear or constrained dynamic systems for which few general methods with established properties are available. The two fundamental forms are moving horizon estimation (MHE) which uses the nearest measurements within a moving time horizon, and its theoretical ideal, full information estimation (FIE) which uses all measurements up to the time of estimation. Despite extensive studies, the stability analyses of FIE and MHE for discrete-time nonlinear systems with bounded process and measurement disturbances, remain an open challenge. This work aims to provide a systematic solution for the challenge. First, we prove that FIE is robustly globally asymptotically stable (RGAS) if the cost function admits a property mimicking the incremental input/output-to-state stability (i-IOSS) of the system and has a sufficient sensitivity to the uncertainty in the initial state. Second, we establish an explicit link from the RGAS of FIE to that of MHE, and use it to show that MHE is RGAS under enhanced conditions if the moving horizon is long enough to suppress the propagation of uncertainties. The theoretical results imply flexible MHE designs with assured robust stability for a broad class of i-IOSS systems. Numerical experiments on linear and nonlinear systems are used to illustrate the designs and support the findings.
In this paper, we are interested in the existence of Pareto solutions to vector polynomial optimization problems over a basic closed semi-algebraic set. By invoking some powerful tools from real semi-algebraic geometry, we first introduce the concept called {it tangency varieties}; then we establish connections of the Palais--Smale condition, Cerami condition, {it M}-tameness, and properness related to the considered problem, in which the condition of regularity at infinity plays an essential role in deriving these connections. According to the obtained connections, we provide some sufficient conditions for existence of Pareto solutions to the problem in consideration, and we also give some examples to illustrate our main findings.
We present a distributionally robust formulation of a stochastic optimization problem for non-i.i.d vector autoregressive data. We use the Wasserstein distance to define robustness in the space of distributions and we show, using duality theory, that the problem is equivalent to a finite convex-concave saddle point problem. The performance of the method is demonstrated on both synthetic and real data.
The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a particular Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges super-linearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
