一类线性约束变分不等式问题的幂罚函数法

本文研究了一类线性约束变分不等式(Ⅵ)的幂罚函数法求解问题.利用Ⅵ的KKT条件,将Ⅵ转化为等价的混合互补问题和一个新的Ⅵ问题,并在一定条件下分析了解的存在性和唯一性.利用度理论证明了幂罚方程组解的存在性与唯一性.由以上结果最终证明了幂罚函数法的收敛性,即幂罚方程组的解收敛于Ⅵ问题的解.     

一类自然增长条件下带积分和障碍约束的变分问题

本文考虑二次泛函 F(u)=(x,u)D_αu~iD_βu~i 在约束{u∈H_0~(1.2)(Ω)~N,u(x)≥(x)a.e.于Ω,g(x,u)dx=k_0}下的极小问题,这里α_(αβ)(x,u)关于 u 不必是一致有界的.这类问题的变分在Ω的局部对应于一个拟线性变分不等式组的特征问题,结合变分方法,线性化和逆Hlder 估计,本文讨论了其广义有界解的存在性和正则性.     

一类自然增长条件下带积分和障碍约束的变分问题

本文考虑二次泛函F(u)=integral from n=Ω (α_(αβ)(x,u)D_αu~iD_βu~i)在约束{u∈H_0~(1.2)(Ω)~N,u(x)≥ψ(x)a.e.于Ω,integral from n=Ω (g(x,u)dx)=k_0}下的极小问题,这里α_(αβ)(x,u)关于u不必是一致有界的。这类问题的变分在Ω的局部对应于一个拟线性变分不等式组的特征问题,结合变分方法,线性化和逆H(?)lder估计,本文讨论了其广义有界解的存在性和正则性。     

关于一类随机变分不等式和随机拟变分不等式问题

本文对单值和多值情形的随机变分不等式和随机拟变分不等式得出可测解的存在性条件。另外还利用KKM-技巧及著名的Ky Fan定理对一类确定型的广义拟变分不等式讨论了解的存在性问题。本文的结果改进和发展了[10,11,12]中的重要结果。     

一类单边约束问题的数值方法

本文分别基于原始变分形式与对偶混合变分形式，对一类单边约束问题进行了数值求解，提出了求解离散对偶混合变分问题的Uzawa型算法，并用数值例子验证了算法的有效性．     

箱式约束变分不等式的一类新光滑gap函数

针对箱式约束变分不等式问题,利用一类积分型全局最优性条件,提出了一个新光滑gap函数．该光滑gap函数形式简单且具有较好的性质．利用该gap函数,箱式约束变分不等式可转化为等价光滑优化问题进行求解．进一步地,讨论了可保证等价光滑优化问题的任意聚点为箱式约束变分不等式问题解的条件．以一个简单的摩擦接触问题为例阐释了该方法的应用．最后,利用标准的变分不等式考题验证了方法的有效性．     

求解不可微箱约束变分不等式的下降算法

1 引 论 设X(?)Rn是非空闭集,F:Rn→Rn连续映射,变分不等式问题VI(X,F)是指:求x∈X,使 F(x)T(y-x)≥0,　 (?)y∈X,(1)记指标集N=(1,2,…,n},当 X=[a,b]≡{x∈Rn|a≤xi≤bi,i∈N},(2)其中a={a1,a2,…,an}T,b={b1,b2,…,bn}T∈Rn时,VI(X,F)化为箱约束变分不等式VI(a,b,F).若ai=0,bi=+∞,i∈N,即X=R+n≡{x∈Rn|x≥0}时,VI(a,b,F)化为非线性     

一类非对称单调变分不等式的交替方向法

对一类非对称变分不等式问题提出了交替方向法。推广了交替方向仅适用于等式约束或不等约束的情形，得出了迭代序列的一些性质及收敛性．     

具不等式约束变分不等式的信赖域算法

1　引　　言令Ｘ是Ｒｎ 中的非空闭凸集 ,Ｆ :Ｘ→Ｒｎ 是连续映射 ,〈· ,·〉表示Ｒｎ 中的内积 有限维变分不等式问题 (以下简称变分不等式问题 ,记为ＶＩＰ或ＶＩ(Ｘ ,Ｆ) ) :就是求ｘ ∈Ｒｎ,使ｘ ∈Ｘ且 ｘ ∈Ｘ ,〈Ｆ(ｘ ) ,ｘ -ｘ 〉≥ 0 . ( 1 )在Ｘ =Ｒｎ+ 的特殊情形下 ,( 1 )变为非线性互补问题 (记为ＮＣＰ或ＮＣＰ(Ｆ) ) :就是求ｘ ∈Ｒｎ,使ｘ ≥ 0 ,Ｆ(ｘ ) ≥ 0 ,且〈ｘ ,Ｆ(ｘ )〉 =0 . ( 2 )　　变分不等式长期以来一直用于阐述和研究经济学、控制论、交通运输等领域中出现的各种平衡模型 近二十年来 ,变分不等式及其…     

含约束临界Kirchhoff型约束变分问题极小解的存在性及其极限行为

非线性Kirchhoff型约束变分问题当非线性项只含一个幂次项且指数为约束临界p=2+8/N时,由现有文献可知该问题不存在极小解.本文考虑了含低阶扰动项和约束临界指数项的Kirchhoff型约束变分问题,利用伸缩技巧、集中紧原理和Pohozaev恒等式,得到了扰动项指数和系数对该变分问题极小解存在性的影响,并证明该极小解是相对应的Kirchhoff方程的基态解.进一步,本文通过精细的能量估计,探讨扰动项指数趋于约束临界指数时极小能量和极小解的极限行为.     

Direct Numerical Algorithm for Constrained Variational Problems

We propose a direct treatment for the numerical simulation of optimal solutions for vector, one-dimensional variational problems under pointwise constraints in the form of several inequalities. It is an iterative procedure to approximate the optimal solutions of such variational problems that rely on our ability to e?ciently approximate the optimal solutions of variational problems without restrictions, except possibly for end point constraints. One main advantage is that there is no need to control the free boundary, or the contact set, during the iterative process where constraints are active. In addition to proving some convergence results, the scheme is illustrated through several typical situations.     

Generic Well-Posedness of Nonconvex Constrained Variational Problems

In our previous work, a generic well-posedness result (with respect to the variations of the integrand of the integral functional) was established for a class of nonconvex optimal control problems. In this paper, we extend this generic well-posedness result to classes of constrained variational problems in which the values at the endpoints and the constraint maps are also subject to variations. We consider constrained variational problems with constraint maps which depend on the independent variable and also on the state variable.The author is grateful to the referees for helpful comments and suggestions.     

Heuristics for Large Constrained Vehicle Routing Problems

This paper presents a heuristic for solving very large routing problems (thousands of customers and hundreds of vehicles) with side constraints such as time windows. When applied to traditional benchmarks (Solomon's), we obtain high quality results with short resolution time (a few seconds). We also introduce a LDS (Limited Discrepancy Search) variation that produces state-of-the-art results. The heart of this heuristic is a combination of a look-ahead insertion algorithm, an incremental local optimization scheme and a constraint solver for constrained traveling salesman problems. The incrementality means that instead of visiting some large neighborhood after an initial solution has been found, a limited number of moves is examined, after each insertion, on the partial solution. This incremental version is not only faster, it also yields better results than using local optimization once a full solution has been built. We also show how additional constraints can be used in order to guide the insertion process. Because of its use of separate CP (Constraint Programming) modules, this method is flexible and may be used to solve large dispatching problems that include many additional constraints such as setup times (asymmetrical distance) or skill matching.     

盒子型区域上变分不等式的一个光滑牛顿法(英文)

The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational inequality problem based on a new smoothing approximation function.The proposed algorithm is proved to be well defined and convergent globally under weaker conditions.     

Macro-Hybrid Variational Formulations of Constrained Boundary Value Problems

In the context of convex analysis, macro-hybrid variational formulations of constrained boundary value problems are presented. Monotone mixed variational inclusions are macro-hybridized on the basis of nonoverlapping domain decompositions, and corresponding three-field versions are derived. Then, for regularization purposes, augmented formulations are established via preconditioned exact penalizations and expressed in terms of proximation operators. Optimization interpretations are given for potential problems, recovering the classic two- and three-field augmented Lagrangian formulations. Furthermore, associated parallel two- and three-field proximal-point algorithms are discussed for numerical resolution of finite element discretizations. Applications to dual mixed variational formulations of problems from mechanics illustrate the theory.     

Regularity of Optimal Controls for State Constrained Problems

Conditions are given under which optimal controls are Lipschitz continuous, for dynamic optimization problems with functional inequality constraints. The linear independence condition on active state constraints, present in the earlier literature, can be replaced by a less restrictive, positive linear independence condition, that requires linear independence merely with respect to non-negative weighting parameters. Smoothness conditions on the data are also relaxed. A key part of the proof involves an analysis of the implications of first order optimality conditions in the form of a nonsmooth Maximum Principle.     

Some Optimal Control Problems Governed by Elliptic Variational Inequalities with Control and State Constraint on the Boundary

This work deals with the necessary conditions of optimality for some optimal control problems governed by elliptic variational inequalities. Boundary control and state constrained problems are considered. The techniques used are based on those in Ref. 1 and a new penalty functional is defined in this paper.     

A Stability Theorem for Constrained Optimal Control Problems

This paper presents the stability of difference approximations of an optimal control problem for a quasilinear parabolic equation with controls in the coefficients, boundary conditions and additional restrictions. The optimal control problem has been convered to one of the optimization problem using a penalty function technique. The difference approximations problem for the considered problem is obtained. The estimations of stability of the solution of difference approximations problem are proved. The stability estimation of the solution of difference approximations problem by the controls is obtained.     

Generic Well-Posedness of Constrained Variational Problems Without Convexity Assumptions

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 classes of constrained variational problems in which the values at the endpoints and constraint maps are also subject to variations.     

Bound Constrained Smooth Optimization for Solving Variational Inequalities and Related Problems

Variational inequalities and related problems may be solved via smooth bound constrained optimization. A comprehensive discussion of the important features involved with this strategy is presented. Complementarity problems and mathematical programming problems with equilibrium constraints are included in this report. Numerical experiments are commented. Conclusions and directions of future research are indicated.