Sensitivity of solutions to convex, control constrained optimal control problems for distributed parameter systems
نویسندگان
چکیده
منابع مشابه
Solutions to Probabilistic Constrained Optimal Control Problems Using Concentration Inequalities
Recently, optimal control problems subject to probabilistic constraints have attracted much attention in many research field. Although probabilistic constraints are generally intractable in optimization problems, several methods haven been proposed to deal with probabilistic constraints. In most methods, probabilistic constraints are transformed to deterministic constraints that are tractable i...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملA Double Smoothing Technique for Constrained Convex Optimization Problems and Applications to Optimal Control
In this paper, we propose an efficient approach for solving a class of convex optimization problems in Hilbert spaces. Our feasible region is a (possibly infinite-dimensional) simple convex set, i.e. we assume that projections on this set are computationally easy to compute. The problem we consider is the minimization of a convex function over this region under the additional constraint Au ∈ T ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1986
ISSN: 0022-247X
DOI: 10.1016/0022-247x(86)90213-1