Comparing two methods of resolving homogeneous differential inclusions

Given a compact set we consider the differential inclusion We show how to use the main idea of the method of convex integration [ N], [G], [K] (to control convergence of the gradients of a sequence of approximate solutions by appropriate selection of the sequence) to obtain an optimal existence result. We compare this result with the ones available by the Baire category approach applied to the set of admissible functions with topology. A byproduct of our result is attainment in the minimization problems with integrands L having quasiaffine quasiconvexification that was, in fact, the reason of our interest to differential inclusions. This result can be considered as a first step towards characterization of those minimization problems which are solvable for all boundary data. This problem was solved in [S1] in the scalar case m=1. Received November 5, 1998 / Accepted July 17, 2000 / Published online December 8, 2000     

Generic existence of Lipschitzian solutions of optimal control problems without convexity assumptions

The Tonelli existence theorem in the calculus of variations and its subsequent modifications were established for integrands f which satisfy convexity and growth conditions. In this paper we consider a large class of optimal control problems which is identified with a complete metric space of integrands without convexity assumptions and show that for a generic integrand the corresponding optimal control problem possesses a unique solution and this solution is Lipschitzian.     

Generic well-posedness of nonconvex optimal control problems

The Tonelli existence theorem in the calculus of variations and its subsequent modifications were established for integrands f which satisfy convexity and growth conditions. In our previous work a generic existence and uniqueness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper we extend this generic existence and uniqueness result to a class of optimal control problems in which the right-hand side of differential equations is also subject to variations.     

Generic well-posedness of variational problems without convexity assumptions

The Tonelli existence theorem in the calculus of variations and its subsequent modifications were established for integrands f which satisfy convexity and growth conditions. In our previous work a generic well-posedness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper we extend this generic well-posedness result to two classes of variational problems in which the values at the end points are also subject to variations. The main results of the paper are obtained as realizations of a general variational principle.     

First and second order sufficient conditions for optimal control and the calculus of variations

In this paper we develop first and second order sufficient conditions for optimal control and the calculus of variations problems. Our conditions are derived from the Hamilton-Jacobi approach [15, Thm. 2], which was obtained for the generalized problem of Bolza. We do not require any convexity on the data [7] and [11], or that the control setU is polyhedral [14], or that the control function is in the interior ofU [8]. Instead, we assume a certain inequality which is satisfied in each of the above mentioned cases.The publication of this report has been made possible due to a grant of the Fonds FCAC for the help and support of research.     

向量值测度与线性系统最优控制问题的必要条件

The vector-valued measure defined by the well-posed linear boundary value problems is discussed. The maximum principle of the optimal control problem with non-convex constraintis proved by using the vector-valued measure. Especially, the necessary conditions of the optimal control of elliptic systems is derived without the convexity of the control domain and the cost function. optimal control, maximum principle, distributed parameter system, linear system,vector-valued measure.     

The structure of approximate solutions of variational problems without convexity

In this work we study the structure of approximate solutions of variational problems with continuous integrands f:[0,∞)×Rn×Rn→R1 which belong to a complete metric space of functions. We do not impose any convexity assumption. The main result in this paper deals with the turnpike property of variational problems. To have this property means that the approximate solutions of the problems are determined mainly by the integrand, and are essentially independent of the choice of interval and endpoint conditions, except in regions close to the endpoints.     

Adaptive Wavelet Methods II—Beyond the Elliptic Case

This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability of the adaptive wavelet-based method developed in [17] for symmetric positive definite problems to indefinite or unsymmetric systems of operator equations. This is accomplished by first introducing techniques (such as the least squares formulation developed in [26]) that transform the original (continuous) problem into an equivalent infinite system of equations which is now well-posed in the Euclidean metric. It is then shown how to utilize adaptive techniques to solve the resulting infinite system of equations. This second step requires a significant modification of the ideas from [17]. The main departure from [17] is to develop an iterative scheme that directly applies to the infinite-dimensional problem rather than finite subproblems derived from the infinite problem. This rests on an adaptive application of the infinite-dimensional operator to finite vectors representing elements from finite-dimensional trial spaces. It is shown that for a wide range of problems, this new adaptive method performs with asymptotically optimal complexity, i.e., it recovers an approximate solution with desired accuracy at a computational expense that stays proportional to the number of terms in a corresponding wavelet-best N -term approximation. An important advantage of this adaptive approach is that it automatically stabilizes the numerical procedure so that, for instance, compatibility constraints on the choice of trial spaces, like the LBB condition, no longer arise.     

Optimal Solutions of Linear Periodic Control Systems with Convex Integrands

In this work we study the existence and asymptotic behavior of overtaking optimal trajectories for linear control systems with convex integrands. We extend the results obtained by Artstein and Leizarowitz for tracking periodic problems with quadratic integrands [2] and establish the existence and uniqueness of optimal trajectories on an infinite horizon. The asymptotic dynamics of finite time optimizers is examined. Accepted 31 January 1996     

Pointwise well-posedness in set optimization with cone proper sets

This paper deals with the well-posedness property in the setting of set optimization problems. By using a notion of well-posed set optimization problem due to Zhang et al. (2009) [18] and a scalarization process, we characterize this property through the well-posedness, in the Tykhonov sense, of a family of scalar optimization problems and we show that certain quasiconvex set optimization problems are well-posed. Our approach is based just on a weak boundedness assumption, called cone properness, that is unavoidable to obtain a meaningful set optimization problem.     

Well Posedness in Vector Optimization Problems and Vector Variational Inequalities

In this paper, we give notions of well posedness for a vector optimization problem and a vector variational inequality of the differential type. First, the basic properties of well-posed vector optimization problems are studied and the case of C-quasiconvex problems is explored. Further, we investigate the links between the well posedness of a vector optimization problem and of a vector variational inequality. We show that, under the convexity of the objective function f, the two notions coincide. These results extend properties which are well known in scalar optimization. Communicated by F. Giannessi     

On an optimal harvesting problem

Kaplan [1972] treated a harvesting problem as a discrete time stochastic control model with independent disturbances and with decreasing mean value increase depending either on the value or on the age of the asset. We consider the more general model where the mean value increase depends on the value and also on the age. As main result we obtain the existence of optimal control-limit policies with respect to three different natural orders in state space. A basic role play additional convexity and boundedness assumptions. Our findings extend and correct the main result of Kaplan. The paper contains further detailed information about the solution.     

Smolyak cubature of given polynomial degree with few nodes for increasing dimension

Summary. Some recent investigations (see e.g., Gerstner and Griebel [5], Novak and Ritter [9] and [10], Novak, Ritter and Steinbauer [11], Wasilkowski and Woźniakowski [18] or Petras [13]) show that the so-called Smolyak algorithm applied to a cubature problem on the d-dimensional cube seems to be particularly useful for smooth integrands. The problem is still that the numbers of nodes grow (polynomially but) fast for increasing dimensions. We therefore investigate how to obtain Smolyak cubature formulae with a given degree of polynomial exactness and the asymptotically minimal number of nodes for increasing dimension d and obtain their characterization for a subset of Smolyak formulae. Error bounds and numerical examples show their good behaviour for smooth integrands. A modification can be applied successfully to problems of mathematical finance as indicated by a further numerical example. Received September 24, 2001 / Revised version received January 24, 2002 / Published online April 17, 2002 RID="*" ID="*" The author is supported by a Heisenberg scholarship of the Deutsche Forschungsgemeinschaft     

双周期5阶Kadomtsev-Petviashvili Ⅱ方程的局部适定性——献给陆善镇教授75华诞

本文研究5阶双周期Kadomtsev-Petviashvili Ⅱ（KP-Ⅱ）方程的局部适定性.具体地,当正则指标s〉-3/4时,本文获得双周期5阶KP-Ⅱ问题在各向异性的Sobolev空间Hs,0（T×T）上的局部适定性.为此,本文充分挖掘KP波所特有的一些对称结构,详细讨论两个波在频率空间垂直方向上分离时相互作用的结果.本文发现,两个波在频率空间上只要不完全重合,就不会发生共振现象.本文的一个重要贡献在于引入一类与Galilie变换可交换的双线性算子,并获得该类双线性算子的L^2有界估计.这些算子的引入可以充分理解KP波的相互作用机制.从而克服之前对Strichartz型估计的依赖,使本文能够很大程度上推进已知的结果.     

When are solutions to nonlinear elliptic boundary value problems convex?

We extend and apply a concavity maximum principle from [10, 9, 7] to some nonlinear elliptic boundary problems and free boundary problems on convex domains Ω?IRⁿ. In particular we extend "convex dead core' results from n = 2 as in [4 ] to arbitrary n. We also show the convexity of the coincidence set in the obstacle problem under suitable assumptions.     

The integral geometry boundary determination problem for a pencil of straight lines

Under consideration is the problem of integrating finitely many functions over straight lines. Each function as well as the corresponding line is assumed unknown. The available information is the sum of integrals over all straight lines of a family of pencils in each of which the intersection of lines is a point of a given bounded open set in a finite-dimensional Euclidean space. Each integrand depends on a greater number of variables than the sum of the integrals. Hence, the conventional statement of the problem of determining the integrands becomes underspecified. In this situation we pose and study the problem of determining the discontinuity surfaces of the integrands. The uniqueness theorem is proven under the condition that these surfaces exist. The present article is a refinement of the previous studies of the authors and differs from them in [1–6] by not only some technical improvements but also the principally new fact that the integration is performed over an unknown set.     

Linear matrix inequality representation of sets

This article concerns the question, Which subsets of ?^m can be represented with linear matrix inequalities (LMIs)? This gives some perspective on the scope and limitations of one of the most powerful techniques commonly used in control theory. Also, before having much hope of representing engineering problems as LMIs by automatic methods, one needs a good idea of which problems can and cannot be represented by LMIs. Little is currently known about such problems. In this article we give a necessary condition that we call “rigid convexity,” which must hold for a set ?? ? ?^m in order for ?? to have an LMI representation. Rigid convexity is proved to be necessary and sufficient when m = 2. This settles a question formally stated by Pablo Parrilo and Berndt Sturmfels in [15]. As shown by Lewis, Parillo, and Ramana [11], our main result also establishes (in the case of three variables) a 1958 conjecture by Peter Lax on hyperbolic polynomials. © 2006 Wiley Periodicals, Inc.     

Dinkelbach Approach to Solving a Class of Fractional Optimal Control Problems

We consider optimal control problems with functional given by the ratio of two integrals (fractional optimal control problems). In particular, we focus on a special case with affine integrands and linear dynamics with respect to state and control. Since the standard optimal control theory cannot be used directly to solve a problem of this kind, we apply Dinkelbach’s approach to linearize it. Indeed, the fractional optimal control problem can be transformed into an equivalent monoparametric family {P_q} of linear optimal control problems. The special structure of the class of problems considered allows solving the fractional problem either explicitly or requiring straightforward classical numerical techniques to solve a single equation. An application to advertising efficiency maximization is presented. This work was partially supported by the Università Ca’ Foscari, Venezia, Italy, the MIUR (PRIN cofinancing 2005), the Council for Grants (under RF President) and State Aid to Fundamental Science Schools (Grant NSh-4113.2008.6). We thank Angelo Miele, Panos Pardalos and the anonymous referees for comments and suggestions.     

Substitutes and complements in network flows viewed as discrete convexity

We study combinatorial properties of the optimal value function of the network flow problem. It is shown by Gale–Politof [Substitutes and complements in networks flow problems, Discrete Appl. Math. 3 (1981) 175–186] that the optimal value function has submodularity and supermodularity w.r.t. problem parameters such as weights and capacities. In this paper we shed a new light on this result from the viewpoint of discrete convex analysis to point out that the submodularity and supermodularity are naturally implied by discrete convexity, called M-convexity and L-convexity, of the optimal value function.     

On the convexity of integrals of multivalued mappings: Applications in control theory

Using the notion of the local convexity index, we characterize in a quantitative way the local convexity of a set in then-dimensional Euclidean space, defined by an integral of a multivalued mapping. We estimate the rate of convergence of the conditional gradient method for solving an abstract optimization problem by means of the convexity index of the constraining set at the solution point. These results are applied to the qualitative analysis of the solutions of time-optimal and Mayer problems for linear control systems, as well as for estimating the convergence rate of algorithms solving these problems.