Parametric problem of completely generalized quasi-variational inequalities.
This paper is concerned with the structure of asymptotically stabilizing feedbacks for a nonlinear control system on . We first introduce a family of discontinuous, piecewise smooth vector fields and derive a number of properties enjoyed by solutions of the corresponding O.D.E's. We then define a class of “patchy feedbacks” which are obtained by patching together a locally finite family of smooth controls. Our main result shows that, if a system is asymptotically controllable at the origin,...
An optimal control problem governed by a bilinear elliptic equation is considered. This problem is solved by the sequential quadratic programming (SQP) method in an infinite-dimensional framework. In each level of this iterative method the solution of linear-quadratic subproblem is computed by a Galerkin projection using proper orthogonal decomposition (POD). Thus, an approximate (inexact) solution of the subproblem is determined. Based on a POD a-posteriori error estimator developed by Tröltzsch...
An optimal control problem governed by a bilinear elliptic equation is considered. This problem is solved by the sequential quadratic programming (SQP) method in an infinite-dimensional framework. In each level of this iterative method the solution of linear-quadratic subproblem is computed by a Galerkin projection using proper orthogonal decomposition (POD). Thus, an approximate (inexact) solution of the subproblem is determined. Based on a POD...
We describe an approach to variational problems, where the solutions appear as pointwise (finite-dimensional) minima for fixed t of the supplemented Lagrangian. The minimization is performed simultaneously with respect to the state variable x and ẋ, as opposed to Pontryagin's maximum principle, where optimization is done only with respect to the ẋ-variable. We use the idea of the equivalent problems of Carathéodory employing suitable (and simple) supplements to the original minimization problem....
This paper is devoted to singular calculus of variations problems with constraint functional not regular at the solution point in the sense that the first derivative is not surjective. In the first part of the paper we pursue an approach based on the constructions of the p-regularity theory. For p-regular calculus of variations problem we formulate and prove necessary and sufficient conditions for optimality in singular case and illustrate our results by classical example of calculus of variations...
We prove that in some classes of optimization problems, like lower semicontinuous functions which are bounded from below, lower semi-continuous or continuous functions which are bounded below by a coercive function and quasi-convex continuous functions with the topology of the uniform convergence, the complement of the set of well-posed problems is σ-porous. These results are obtained as realization of a theorem extending a variational principle of Ioffe-Zaslavski.
Classical models of clusters’ fission have failed to fully explain strange phenomenons like the phenomenon of shattering (Ziff et al., 1987) and the sudden appearance of infinitely many particles in some systems with initial finite particles number. Furthermore, the bounded perturbation theorem presented in (Pazy, 1983) is not in general true in solution operators theory for models of fractional order γ (with 0 < γ ≤ 1). In this article, we introduce and study a model that can be understood as...
In this paper, we propose a primal interior-point method for large sparse generalized minimax optimization. After a short introduction, where the problem is stated, we introduce the basic equations of the Newton method applied to the KKT conditions and propose a primal interior-point method. (i. e. interior point method that uses explicitly computed approximations of Lagrange multipliers instead of their updates). Next we describe the basic algorithm and give more details concerning its implementation...
In this paper, we propose a primal interior-point method for large sparse minimax optimization. After a short introduction, the complete algorithm is introduced and important implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Thus the large sparse nonconvex minimax optimization problems can be solved successfully. The results of extensive computational experiments given in this paper confirm efficiency and robustness of the proposed...