共查询到20条相似文献,搜索用时 125 毫秒
1.
2.
3.
4.
对不等式约束优化问题提出了一个低阶精确罚函数的光滑化算法. 首先给出了光滑罚问题、非光滑罚问题及原问题的目标函数值之间的误差估计,进而在弱的假
设之下证明了光滑罚问题的全局最优解是原问题的近似全局最优解. 最后给出了一个基于光滑罚函数的求解原问题的算法,证明了算法的收敛性,并给出数值算例说明算法的可行性. 相似文献
5.
本文对可微非线性规划问题提出了一类新的近似渐近算法与一类渐近算法,它们都是基于一类逼近l1精确罚函数的罚函数而提出的.并证明了近似算法所得序列若有聚点则其为原问题的最优解;若所得序列为无界的,则给出了序列值收敛到最优值的一个充分条件.对渐近算法,在弱的假设条件下,证明了算法所得的极小点列有界,且其聚点均为原问题的最优解.并在Mangasarian-Fromovitz约束条件下,证明了有限次迭代之后,所有迭代均为可行的,即迭代所得的极小点为可行点. 相似文献
6.
对非线性参数规划问题ε-最优解集集值映射的连续性条件进行了研究.首先在可行集集值映射局部有界且正则的条件下,讨论了非线性参数规划问题最优值函数的连续性,然后针对ε-最优解集集值映射的结构特征并利用此结果和集值分析理论,给出了非线性参数规划问题ε-最优解集集值映射连续的一个充分条件. 相似文献
7.
对非线性参数规划问题$\varepsilon$-最优解集集值映射的连续性条件进行了研究.首先在可行集集值映射局部有界且正则的条件下,讨论了非线性参数规划问题最优值函数的连续性,然后针对$\varepsilon$-最优解集集值映射的结构特征并利用此结果和集值分析理论,给出了非线性参数规划问题$\varepsilon$-最优解集集值映射连续的一个充分条件. 相似文献
8.
求解非线性规划问题的一类对偶算法 总被引:2,自引:0,他引:2
本文提出了一类求解不等式约束非线性规划问题的构造性对偶算法,我们证明在适当的条件下,势函数的罚参数存在一个阀值,当罚参数小于这个阀值时,由这一方法所产生的序列局部收敛于问题的一个Kuhn-Tucker解,我们也建立了解的依赖于罚参数的误差上界,最后,我们给出了一个特残势函数的数值结果。 相似文献
9.
10.
本文研究了一类非线性-线性半向量二层规划问题的罚函数求解方法.对于该类半向量二层规划问题,首先基于下层问题的加权标量化方法和Karush-Kuhn-Tucker最优性条件,将其转化为一般的二层规划问题,并取下层问题的互补约束为罚项,构造出相应的罚问题;然后分析罚问题最优解的相关特征以及最优性条件,进而设计了相应的罚函数算法;最后以相关算例验证了罚函数算法的可行、有效性. 相似文献
11.
In this paper, we address a class of semivectorial bilevel programming problem in which the upper level is a scalar optimization problem and the lower level is a linear multi-objective optimization problem. Then, we present a new penalty function method, which includes two different penalty parameters, for solving such a problem. Furthermore, we give a simple algorithm. Numerical examples show that the proposed algorithm is feasible. 相似文献
12.
In this paper we prove the possibility of the use of the penalty method for grid matching in mixed finite element methods. We consider the Hermann-Johnson scheme for biharmonic equation. The main idea is to construct a perturbed problem with two parameters which play roles of penalties. The perturbed problem is built by the replacement of essential conditions on the interface in the mixed variational statement with natural conditions that contain parameters. The perturbed problem is discretized by the finite element method. We estimate the norm of the difference between a solution of the discrete perturbed problem and a solution of the initial problem; the obtained estimates depend on the step and the penalties. We give recommendations for the choice of penalties depending on the step. 相似文献
13.
Yue Zheng Zhongping Wan Kangtai Sun Tao Zhang 《Journal of Applied Mathematics and Computing》2013,42(1-2):41-49
In this paper, we present an exact penalty method, which is different from the existing penalty method, for solving weak linear bilevel programming problem. Then, we establish an existence result of solutions for such a problem. Finally, we propose an algorithm and give two examples to illustrate its feasibility. 相似文献
14.
Sever Silvestru Dragomir 《Numerical Functional Analysis & Optimization》2013,34(5-6):487-491
A simple model optimal control problem for continuous casting with state-space constraints is approximated, as usual, by a penalty method and by a numerical discretization of the nonlinear heat equation. The convergence of the approximate problems directly to the original problem is proven under a stability criterion linking the penalty parameter with the discretization parameters. For this purpose, known discretization error estimates for the Stefan problem are extended for the case of time varying boundary conditions. 相似文献
15.
Hailong Qiu Yongchao Zhang Liquan Mei Changfeng Xue 《Numerical Methods for Partial Differential Equations》2017,33(3):918-940
In this article, we consider a penalty finite element (FE) method for incompressible Navier‐Stokes type variational inequality with nonlinear damping term. First, we establish penalty variational formulation and prove the well‐posedness and convergence of this problem. Then we show the penalty FE scheme and derive some error estimates. Finally, we give some numerical results to verify the theoretical rate of convergence. © 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 918–940, 2017 相似文献
16.
熵正则化方法与指数(乘子)罚函数法之间的关系 总被引:1,自引:0,他引:1
由于极大极小问题在许多科学与工程中有着重要应用,特别是形如max的函数频繁地出现在各类数值分析和优化问题中,因此对于求解该类问题的算法研究长久不衰,这些算法一般分为两大类:一类是直接法,其算法设计仅以有效地求解原问题(P)为目的;另一类是间接法,其算法以找一个能够替代不可微max函数φ(x)的光滑函数为目的,故这类算法被称为光滑化方法,文[1,2]中的熵正则化方法就属于光滑化方法范畴。 相似文献
17.
We study computability and applicability of error bounds for a given semidefinite pro-gramming problem under the assumption that the recession function associated with the constraint system satisfies the Slater condition. Specifically, we give computable error bounds for the distances between feasible sets, optimal objective values, and optimal solution sets in terms of an upper bound for the condition number of a constraint system, a Lipschitz constant of the objective function, and the size of perturbation. Moreover, we are able to obtain an exact penalty function for semidefinite programming along with a lower bound for penalty parameters. We also apply the results to a class of statistical problems. 相似文献
18.
X. X. Huang 《Journal of Global Optimization》2013,56(4):1501-1513
In this paper, we study a class of penalty methods for a class of constrained scalar set-valued optimization problems. We establish an equivalence relation between the lower semicontinuity at the origin of the optimal value function of the perturbed problem and the convergence of the penalty methods. Some sufficient conditions that guarantee the convergence of the penalty methods are also derived. 相似文献
19.