2,461 research outputs found

    Variational Analysis of Evolution Inclusions

    Get PDF
    The paper is devoted to optimization problems of the Bolza and Mayer types for evolution systems governed by nonconvex Lipschitzian differential inclusions in Banach spaces under endpoint constraints described by finitely many equalities and inequalities. with generally nonsmooth functions. We develop a variational analysis of such roblems mainly based on their discrete approximations and the usage of advanced tools of generalized differentiation satisfying comprehensive calculus rules in the framework of Asplund (and hence any reflexive Banach) spaces. In this way we establish extended results on stability of discrete approximations (with the strong W^1,2-convergence of optimal solutions under consistent perturbations of endpoint constraints) and derive necessary optimality conditions for nonconvex discrete-time and continuous-time systems in the refined Euler-Lagrange and Weierstrass-Pontryagin forms accompanied by the appropriate transversality inclusions. In contrast to the case of geometric endpoint constraints in infinite dimensions, the necessary optimality conditions obtained in this paper do not impose any nonempty interiority /finite codimension/normal compactness assumptions. The approach and results developed in the paper make a bridge between optimal control/dynamic optimization and constrained mathematical programming problems in infinite-dimensional spaces

    Optimal Control of Delay-Differential Inclusions with Multivalued Initial Conditions in Infinite Dimensions

    Get PDF
    This paper is devoted to the study of a general class of optimal control problems described by delay-differential inclusions with infinite-dimensional state spaces, endpoints constraints, and multivalued initial conditions. To the best of our knowledge, problems of this type have not been considered in the literature, except some particular cases when either the state space is finite-dimensional or there is no delay in the dynamics. We develop the method of discrete approximations to derive necessary optimality conditions in the extended Euler-Lagrange form by using advanced tools of variational analysis and generalized differentiation in infinite dimensions. This method consists of the three major parts: (a) constructing a well-posed sequence of discrete-time problems that approximate in an appropriate sense the original continuous-time problem of dynamic optimization; (b) deriving necessary optimality conditions for the approximating discrete-time problems by reducing them to infinite-dimensional problems of mathematical programming and employing then generalized differential calculus; (c) passing finally to the limit in the obtained results for discrete approximations to establish necessary conditions for the given optimal solutions to the original problem. This method is fully realized in the delay-differential systems under consideration

    Generalized equilibrium in an economy without the survival assumption

    Get PDF
    It is well known that an equilibrium in the Arrow-Debreu model may fail to exist if a very restrictive condition called the survival assumption is not satisfied. We study two approaches that allow for the relaxation of this condition. Danilov and Sotskov (1990), and Florig (2001) developed a concept of a generalized equilibrium based on a notion of hierarchic prices. Marakulin (1990) proposed a concept of an equilibrium with non-standard prices. In this paper, we establish the equivalence between non-standard and hierarchic equilibria. Furthermore, we show that for any specified system of dividends the set of such equilibria is generically finite. We also provide a generic characterization of hierarchic equilibria and give an easy proof of the core equivalence result

    Numerical upscaling of parametric microstructures in a possibilistic uncertainty framework with tensor trains

    Get PDF
    A fuzzy arithmetic framework for the efficient possibilistic propagation of shape uncertainties based on a novel fuzzy edge detection method is introduced. The shape uncertainties stem from a blurred image that encodes the distribution of two phases in a composite material. The proposed framework employs computational homogenisation to upscale the shape uncertainty to a effective material with fuzzy material properties. For this, many samples of a linear elasticity problem have to be computed, which is significantly sped up by a highly accurate low-rank tensor surrogate. To ensure the continuity of the underlying mapping from shape parametrisation to the upscaled material behaviour, a diffeomorphism is constructed by generating an appropriate family of meshes via transformation of a reference mesh. The shape uncertainty is then propagated to measure the distance of the upscaled material to the isotropic and orthotropic material class. Finally, the fuzzy effective material is used to compute bounds for the average displacement of a non-homogenized material with uncertain star-shaped inclusion shapes

    Fuzzy System Identification Based Upon a Novel Approach to Nonlinear Optimization

    Get PDF
    Fuzzy systems are often used to model the behavior of nonlinear dynamical systems in process control industries because the model is linguistic in nature, uses a natural-language rule set, and because they can be included in control laws that meet the design goals. However, because the rigorous study of fuzzy logic is relatively recent, there is a shortage of well-defined and understood mechanisms for the design of a fuzzy system. One of the greatest challenges in fuzzy modeling is to determine a suitable structure, parameters, and rules that minimize an appropriately chosen error between the fuzzy system, a mathematical model, and the target system. Numerous methods for establishing a suitable fuzzy system have been proposed, however, none are able to demonstrate the existence of a structure, parameters, or rule base that will minimize the error between the fuzzy and the target system. The piecewise linear approximator (PLA) is a mathematical construct that can be used to approximate an input-output data set with a series of connected line segments. The number of segments in the PLA is generally selected by the designer to meet a given error criteria. Increasing the number of segments will generally improve the approximation. If the location of the breakpoints between segments is known, it is a straightforward process to select the PLA parameters to minimize the error. However, if the location of the breakpoints is not known, a mechanism is required to determine their locations. While algorithms exist that will determine the location of the breakpoints, they do not minimize the error between data and the model. This work will develop theory that shows that an optimal solution to this nonlinear optimization problem exists and demonstrates how it can be applied to fuzzy modeling. This work also demonstrates that a fuzzy system restricted to a particular class of input membership functions, output membership functions, conjunction operator, and defuzzification technique is equivalent to a piecewise linear approximator (PLA). Furthermore, this work develops a new nonlinear optimization technique that minimizes the error between a PLA and an arbitrary one-dimensional set of input-output data and solves the optimal breakpoint problem. This nonlinear optimization technique minimizes the approximation error of several classes of nonlinear functions leading up to the generalized PLA. While direct application of this technique is computationally intensive, several paths are available for investigation that may ease this limitation. An algorithm is developed based on this optimization theory that is significantly more computationally tractable. Several potential applications of this work are discussed including the ability to model the nonlinear portions of Hammerstein and Wiener systems

    Fuzzy Sets, Fuzzy Logic and Their Applications

    Get PDF
    The present book contains 20 articles collected from amongst the 53 total submitted manuscripts for the Special Issue “Fuzzy Sets, Fuzzy Loigic and Their Applications” of the MDPI journal Mathematics. The articles, which appear in the book in the series in which they were accepted, published in Volumes 7 (2019) and 8 (2020) of the journal, cover a wide range of topics connected to the theory and applications of fuzzy systems and their extensions and generalizations. This range includes, among others, management of the uncertainty in a fuzzy environment; fuzzy assessment methods of human-machine performance; fuzzy graphs; fuzzy topological and convergence spaces; bipolar fuzzy relations; type-2 fuzzy; and intuitionistic, interval-valued, complex, picture, and Pythagorean fuzzy sets, soft sets and algebras, etc. The applications presented are oriented to finance, fuzzy analytic hierarchy, green supply chain industries, smart health practice, and hotel selection. This wide range of topics makes the book interesting for all those working in the wider area of Fuzzy sets and systems and of fuzzy logic and for those who have the proper mathematical background who wish to become familiar with recent advances in fuzzy mathematics, which has entered to almost all sectors of human life and activity

    Optimality conditions, approximate stationarity, and applications 'a story beyond lipschitzness

    Get PDF
    Approximate necessary optimality conditions in terms of Frechet subgradients and normals for a rather general optimization problem with a potentially non-Lipschitzian objective function are established with the aid of Ekeland's variational principle, the fuzzy Frechet subdifferential sum rule, and a novel notion of lower semicontinuity relative to a set-valued mapping or set. Feasible points satisfying these optimality conditions are referred to as approximately stationary. As applications, we derive a new general version of the extremal principle. Furthermore, we study approximate stationarity conditions for an optimization problem with a composite objective function and geometric constraints, a qualification condition guaranteeing that approximately stationary points of such a problem are M-stationary, and a multiplier-penalty-method which naturally computes approximately stationary points of the underlying problem. Finally, necessary optimality conditions for an optimal control problem with a non-Lipschitzian sparsity-promoting term in the objective function are established. © The authors
    corecore