اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn estimating the regular normal cone to constraint systems and stationarity conditions
194
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Estimating the regular normal cone to constraint systems plays an important role for the derivation of sharp necessary optimality conditions. We present two novel approaches and introduce a new stationarity concept which is stronger than M-stationarity. We apply our theory to three classes of mathematical programs frequently arising in the literature.
قيم البحث
اقرأ أيضاً
We derive an optimal control formulation for a nonholonomic mechanical system using the nonholonomic constraint itself as the control. We focus on Suslovs problem, which is defined as the motion of a rigid body with a vanishing projection of the body
frame angular velocity on a given direction $boldsymbol{xi}$. We derive the optimal control formulation, first for an arbitrary group, and then in the classical realization of Suslovs problem for the rotation group $SO(3)$. We show that it is possible to control the system using the constraint $boldsymbol{xi}(t)$ and demonstrate numerical examples in which the system tracks quite complex trajectories such as a spiral.
The error bound property for a solution set defined by a set-valued mapping refers to an inequality that bounds the distance between vectors closed to a solution of the given set by a residual function. The error bound property is a Lipschitz-like/ca
lmness property of the perturbed solution mapping, or equivalently the metric subregularity of the underlining set-valued mapping. It has been proved to be extremely useful in analyzing the convergence of many algorithms for solving optimization problems, as well as serving as a constraint qualification for optimality conditions. In this paper, we study the error bound property for the solution set of a very general second-order cone complementarity problem (SOCCP). We derive some sufficient conditions for error bounds for SOCCP which is verifiable based on the initial problem data.
We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging barriers.
For the purpose, we first show how error bounds may be constructed using objects called facial residual functions. Then, we develop several tools to compute facial residual functions even in the absence of closed form expressions for the projections onto the cones. We demonstrate the use and power of our results by computing tight error bounds for the exponential cone feasibility problem. Interestingly, we discover a natural example for which the tightest error bound is related to the Boltzmann-Shannon entropy. We were also able to produce an example of sets for which a H{o}lderian error bound holds but the supremum of the set of admissible exponents is not itself an admissible exponent.
In this paper we study the problem of inferring the initial conditions of a dynamical system under incomplete information. Studying several model systems, we infer the latent microstates that best reproduce an observed time series when the observatio
ns are sparse,noisy and aggregated under a (possibly) nonlinear observation operator. This is done by minimizing the least-squares distance between the observed time series and a model-simulated time series using gradient-based methods. We validate this method for the Lorenz and Mackey-Glass systems by making out-of-sample predictions. Finally, we analyze the predicting power of our method as a function of the number of observations available. We find a critical transition for the Mackey-Glass system, beyond which it can be initialized with arbitrary precision.
This paper studies the graph-theoretic conditions for stability of positive monotone systems. Using concepts from input-to-state stability and network small-gain theory, we first establish necessary and sufficient conditions for the stability of line
ar positive systems described by Metzler matrices. Specifically, we derive two sets of stability conditions based on two forms of input-to-state stability gains for Metzler systems, namely max-interconnection gains and sum-interconnection gains. Based on the max-interconnection gains, we show that the cyclic small-gain theorem becomes necessary and sufficient for the stability of Metzler systems; based on the sum-interconnection gains, we obtain novel graph-theoretic conditions for the stability of Metzler systems. All these conditions highlight the role of cycles in the interconnection graph and unveil how the structural properties of the graph affect stability. Finally, we extend our results to the nonlinear monotone system and obtain similar sufficient conditions for global asymptotic stability.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
