Inverse coefficient problems for elliptic equations in a cylinder: II

We study sufficient conditions for the unique solvability of the inverse coefficient problem. We obtain various global sufficient conditions in the form of constraints on the signs of the given functions and their derivatives. As a corollary, we consider statements of inverse coefficient problems with overdetermination on the boundary, where the Dirichlet conditions are supplemented with the vanishing condition for the normal derivative on part of the boundary. We prove sufficient conditions for the existence of a solution in this case.     

Inverse coefficient problems for elliptic equations in a cylinder: I

We study sufficient conditions for the unique solvability of the inverse coefficient problem. We obtain various global sufficient conditions in the form of constraints on the signs of the given functions and their derivatives. As a corollary, we consider statements of inverse coefficient problems with overdetermination on the boundary, where the Dirichlet conditions are supplemented with the vanishing condition for the normal derivative on part of the boundary.     

Necessary optimality conditions for a special class of bilevel programming problems with unique lower level solution

We consider a bilevel programming problem in Banach spaces whose lower level solution is unique for any choice of the upper level variable. A condition is presented which ensures that the lower level solution mapping is directionally differentiable, and a formula is constructed which can be used to compute this directional derivative. Afterwards, we apply these results in order to obtain first-order necessary optimality conditions for the bilevel programming problem. It is shown that these optimality conditions imply that a certain mathematical program with complementarity constraints in Banach spaces has the optimal solution zero. We state the weak and strong stationarity conditions of this problem as well as corresponding constraint qualifications in order to derive applicable necessary optimality conditions for the original bilevel programming problem. Finally, we use the theory to state new necessary optimality conditions for certain classes of semidefinite bilevel programming problems and present an example in terms of bilevel optimal control.     

Fractional variational problems with the Riesz-Caputo derivative

In this paper we investigate optimality conditions for fractional variational problems, with a Lagrangian depending on the Riesz-Caputo derivative. First we prove a generalized Euler-Lagrange equation for the case when the interval of integration of the functional is different from the interval of the fractional derivative. Next we consider integral dynamic constraints on the problem, for several different cases. Finally, we determine optimality conditions for functionals depending not only on the admissible functions, but on time also, and we present a necessary condition for a pair function-time to be an optimal solution to the problem.     

First-Order Optimality Conditions in Generalized Semi-Infinite Programming

In this paper, we consider a generalized semi-infinite optimization problem where the index set of the corresponding inequality constraints depends on the decision variables and the involved functions are assumed to be continuously differentiable. We derive first-order necessary optimality conditions for such problems by using bounds for the upper and lower directional derivatives of the corresponding optimal value function. In the case where the optimal value function is directly differentiable, we present first-order conditions based on the linearization of the given problem. Finally, we investigate necessary and sufficient first-order conditions by using the calculus of quasidifferentiable functions.     

Approximation integration by using rectangles

<正>In calculus,two famous problems are well known.The one problem of finding the tangent line led us to the derivative.The other problem of finding area led us to find the definite integral.In this paper,we will learn how to approximation integration by using rectangles.1.What does the Riemann sum mean?A given function y=f(x)is continuous on the interval[a,b].We divide the interval     

Formulation of Euler-Lagrange equations for fractional variational problems

This paper presents extensions to traditional calculus of variations for systems containing fractional derivatives. The fractional derivative is described in the Riemann-Liouville sense. Specifically, we consider two problems, the simplest fractional variational problem and the fractional variational problem of Lagrange. Results of the first problem are extended to problems containing multiple fractional derivatives and unknown functions. For the second problem, we also present a Lagrange type multiplier rule. For both problems, we develop the Euler-Lagrange type necessary conditions which must be satisfied for the given functional to be extremum. Two problems are considered to demonstrate the application of the formulation. The formulation presented and the resulting equations are very similar to those that appear in the field of classical calculus of variations.     

求解随机凸规划概率约束问题的对偶算法

1引言随机规划中的概率约束问题在工程和管理中有广泛的应用.因为问题中包含非线性的概率约束,它们的求解非常困难.如果目标函数是线性的,问题的求解就比较容易.给出了一个求解随机线性规划概率约束问题的综述.原-对偶算法和切平面算法是比较有效的.在本文中,我们讨论随机凸规划概率约束问题:     

Inverse problems for elliptic equations in the space: II

We consider inverse problems of finding the right-hand side of a linear second-order elliptic equation of general form. The first boundary value problem is studied. We consider two ways of indicating additional information (overdetermination): the trace of the solution can be given on some lower-dimensional manifold inside the domain, or the normal derivative can be specified on part of the boundary. On the basis of the Fredholm alternative proved in the first part of the present paper for the inverse problems in question, we single out conditions on the given functions under which the inverse problem is uniquely solvable. Various types of such conditions are considered. The study is carried out in the class of continuous functions whose derivatives satisfy the Hölder condition.     

Tracking within a time interval on the basis of data supplied by finite observers

We solve the tracking control problem, in which one should bring a trajectory of a system of linear ordinary differential equations into a neighborhood of a trajectory of another system within a given time interval. After getting into this neighborhood, one should keep the trajectory of the first subsystem in it for a time interval of given duration. For the control synthesis, we use incomplete and imprecise information on the online deviation of one trajectory from the other, which is obtained in real time from linear equations of observation. We consider distinct structures of observers, which substantially affect the solution of control problems for such systems. The equations of dynamics and admissible measurements contain uncertainty for which one knows only some hard pointwise constraints. To solve the main problem, we use an approach that can be reduced to the construction of auxiliary information sets and weakly invariant sets with a subsequent “aiming” of one set at a tube. We suggest an efficient method for an approximate solution on the basis of ellipsoidal calculus techniques. The results of the algorithm operation are illustrated by an example of the solution of a tracking control problem for two fourth-order subsystems.     

An algorithm for the two-dimensional assortment problem

In this paper we consider the two-dimensional assortment problem. This is the problem of choosing from a set of stock rectangles a subset which can be used for cutting into a number of smaller rectangular pieces. Constraints are imposed upon the number of such pieces which result from the cutting.A heuristic algorithm for the guillotine cutting version of the problem is developed based on a greedy procedure for generating two-dimensional cutting patterns, a linear program for choosing the cutting patterns to use and an interchange procedure to decide the best subset of stock rectangles to cut.Computational results are presented for a number of test problems which indicate that the algorithm developed produces good quality results both for assortment problems and for two-dimensional cutting problems.     

A singular control model with application to the goodwill problem

We consider a stochastic system whose uncontrolled state dynamics are modelled by a general one-dimensional Itô diffusion. The control effort that can be applied to this system takes the form that is associated with the so-called monotone follower problem of singular stochastic control. The control problem that we address aims at maximising a performance criterion that rewards high values of the utility derived from the system’s controlled state but penalises any expenditure of control effort. This problem has been motivated by applications such as the so-called goodwill problem in which the system’s state is used to represent the image that a product has in a market, while control expenditure is associated with raising the product’s image, e.g., through advertising. We obtain the solution to the optimisation problem that we consider in a closed analytic form under rather general assumptions. Also, our analysis establishes a number of results that are concerned with analytic as well as probabilistic expressions for the first derivative of the solution to a second-order linear non-homogeneous ordinary differential equation. These results have independent interest and can potentially be of use to the solution of other one-dimensional stochastic control problems.     

A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems

Most real-life decision-making activities require more than one objective to be considered. Therefore, several studies have been presented in the literature that use multiple objectives in decision models. In a mathematical programming context, the majority of these studies deal with two objective functions known as bicriteria optimization, while few of them consider more than two objective functions. In this study, a new algorithm is proposed to generate all nondominated solutions for multiobjective discrete optimization problems with any number of objective functions. In this algorithm, the search is managed over (p − 1)-dimensional rectangles where p represents the number of objectives in the problem and for each rectangle two-stage optimization problems are solved. The algorithm is motivated by the well-known ε-constraint scalarization and its contribution lies in the way rectangles are defined and tracked. The algorithm is compared with former studies on multiobjective knapsack and multiobjective assignment problem instances. The method is highly competitive in terms of solution time and the number of optimization models solved.     

A chain rule for ?-subdifferentials with applications to approximate solutions in convex Pareto problems

In this work we obtain a chain rule for the approximate subdifferential considering a vector-valued proper convex function and its post-composition with a proper convex function of several variables nondecreasing in the sense of the Pareto order. We derive an interesting formula for the conjugate of a composition in the same framework and we prove the chain rule using this formula. To get the results, we require qualification conditions since, in the composition, the initial function is extended vector-valued. This chain rule extends analogous well-known calculus rules obtained when the functions involved are finite and it gives a complementary simple expression for other chain rules proved without assuming any qualification condition. As application we deduce the well-known calculus rule for the addition and we extend the formula for the maximum of functions. Finally, we use them and a scalarization process to obtain Kuhn-Tucker type necessary and sufficient conditions for approximate solutions in convex Pareto problems. These conditions extend other obtained in scalar optimization problems.     

Equilibrium constrained optimization problems

We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated KKM lemma, we prove the existence of feasible points for the equilibrium constraints. Moreover, we analyze the topological and analytical structure of the feasible set. Alternative formulations of an equilibrium constrained optimization problem (ECOP) that are suitable for numerical purposes are also given. As an important first step for developing efficient algorithms, we provide a genericity analysis for the feasible set of a particular ECOP, for which all the functions are assumed to be linear.     

Variational problems for Hölderian functions with free terminal point

We develop the new variational calculus introduced in 2011 by J. Cresson and I. Greff, where the classical derivative is substituted by a new complex operator called the scale derivative. In this paper, we consider several nondifferentiable variational problems with free terminal point with and without constraints of first and higher‐order type. Copyright © 2014 John Wiley & Sons, Ltd.     

Minimization of Energy Functionals Applied to Some Inverse Problems

We consider a general class of problems of the minimization of convex integral functionals subject to linear constraints. Using Fenchel duality, we prove the equality of the values of the minimization problem and its associated dual problem. This equality is a variational criterion for the existence of a solution to a large class of inverse problems entering the class of generalized Fredholm integral equations. In particular, our abstract results are applied to marginal problems for stochastic processes. Such problems naturally arise from the probabilistic approaches to quantum mechanics. Accepted 26 March 2001. Online publication 19 July 2001.