共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper proposes nonlinear Lagrangians based on modified Fischer-Burmeister NCP
functions for solving nonlinear programming problems with inequality constraints. The
convergence theorem shows that the sequence of points generated by this nonlinear Lagrange algorithm is locally convergent when the penalty parameter is less than a threshold
under a set of suitable conditions on problem functions, and the error bound of solution,
depending on the penalty parameter, is also established. It is shown that the condition
number of the nonlinear Lagrangian Hessian at the optimal solution is proportional to the
controlling penalty parameter. Moreover, the paper develops the dual algorithm associated with the proposed nonlinear Lagrangians. Numerical results reported suggest that
the dual algorithm based on proposed nonlinear Lagrangians is effective for solving some
nonlinear optimization problems. 相似文献
2.
介绍一种非线性约束优化的不可微平方根罚函数,为这种非光滑罚函数提出了一个新的光滑化函数和对应的罚优化问题,获得了原问题与光滑化罚优化问题目标之间的误差估计. 基于这种罚函数,提出了一个算法和收敛性证明,数值例子表明算法对解决非线性约束优化具有有效性. 相似文献
3.
Thomas F. Coleman Jianguo Liu Wei Yuan 《Computational Optimization and Applications》2002,21(2):177-199
We present a new trust-region algorithm for solving nonlinear equality constrained optimization problems. Quadratic penalty functions are employed to obtain global convergence. At each iteration a local change of variables is performed to improve the ability of the algorithm to follow the constraint level set. Under certain assumptions we prove that this algorithm globally converges to a point satisfying the second-order necessary optimality conditions. Results of preliminary numerical experiments are reported. 相似文献
4.
M. Fernanda P. Costa Rogério B. Francisco Ana Maria A. C. Rocha Edite M. G. P. Fernandes 《Journal of Optimization Theory and Applications》2017,174(3):875-893
This paper proposes a self-adaptive penalty function and presents a penalty-based algorithm for solving nonsmooth and nonconvex constrained optimization problems. We prove that the general constrained optimization problem is equivalent to a bound constrained problem in the sense that they have the same global solutions. The global minimizer of the penalty function subject to a set of bound constraints may be obtained by a population-based meta-heuristic. Further, a hybrid self-adaptive penalty firefly algorithm, with a local intensification search, is designed, and its convergence analysis is established. The numerical experiments and a comparison with other penalty-based approaches show the effectiveness of the new self-adaptive penalty algorithm in solving constrained global optimization problems. 相似文献
5.
Maksim V. Dolgopolik 《Optimization Letters》2016,10(3):635-648
In the article, we present a new perspective on the method of smooth exact penalty functions that is becoming more and more popular tool for solving constrained optimization problems. In particular, our approach to smooth exact penalty functions allows one to apply previously unused tools (namely, parametric optimization) to the study of these functions. We give a new simple proof of local exactness of smooth penalty functions that significantly generalizes all similar results existing in the literature. We also provide new necessary and sufficient conditions for a smooth penalty function to be globally exact. 相似文献
6.
Smoothed penalty algorithms for optimization of nonlinear models 总被引:1,自引:0,他引:1
M. Herty A. Klar A. K. Singh P. Spellucci 《Computational Optimization and Applications》2007,37(2):157-176
We introduce an algorithm for solving nonlinear optimization problems with general equality and box constraints. The proposed
algorithm is based on smoothing of the exact l
1-penalty function and solving the resulting problem by any box-constraint optimization method. We introduce a general algorithm
and present theoretical results for updating the penalty and smoothing parameter. We apply the algorithm to optimization problems
for nonlinear traffic network models and report on numerical results for a variety of network problems and different solvers
for the subproblems. 相似文献
7.
We analyze the behavior of a parallel proximal point method for solving convex optimization problems in reflexive Banach spaces. Similar algorithms were known to converge under the implicit assumption that the norm of the space is Hilbertian. We extend the area of applicability of the proximal point method to solving convex optimization problems in Banach spaces on which totally convex functions can be found. This includes the class of all smooth uniformly convex Banach spaces. Also, our convergence results leave more flexibility for the choice of the penalty function involved in the algorithm and, in this way, allow simplification of the computational procedure. 相似文献
8.
基于增广Lagrange函数的RQP方法 总被引:3,自引:0,他引:3
Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported. 相似文献
9.
A recursive quadratic programming algorithm that uses differentiable exact penalty functions 总被引:8,自引:0,他引:8
In this paper, a recursive quadratic programming algorithm for solving equality constrained optimization problems is proposed and studied. The line search functions used are approximations to Fletcher's differentiable exact penalty function. Global convergence and local superlinear convergence results are proved, and some numerical results are given. 相似文献
10.
带等式约束的光滑优化问题的一类新的精确罚函数 总被引:1,自引:0,他引:1
罚函数方法是将约束优化问题转化为无约束优化问题的主要方法之一. 不包含目标函数和约束函数梯度信息的罚函数, 称为简单罚函数. 对传统精确罚函数而言, 如果它是简单的就一定是非光滑的; 如果它是光滑的, 就一定不是简单的. 针对等式约束优化问题, 提出一类新的简单罚函数, 该罚函数通过增加一个新的变量来控制罚项. 证明了此罚函数的光滑性和精确性, 并给出了一种解决等式约束优化问题的罚函数算法. 数值结果表明, 该算法对于求解等式约束优化问题是可行的. 相似文献
11.
Zhiqing Meng Chuangyin Dang Xiaoqi Yang 《Computational Optimization and Applications》2006,35(3):375-398
In this paper we propose two methods for smoothing a nonsmooth square-root exact penalty function for inequality constrained
optimization. Error estimations are obtained among the optimal objective function values of the smoothed penalty problem,
of the nonsmooth penalty problem and of the original optimization problem. We develop an algorithm for solving the optimization
problem based on the smoothed penalty function and prove the convergence of the algorithm. The efficiency of the smoothed
penalty function is illustrated with some numerical examples, which show that the algorithm seems efficient. 相似文献
12.
B. Prasad 《Journal of Optimization Theory and Applications》1981,35(2):159-182
A class of generalized variable penalty formulations for solving nonlinear programming problems is presented. The method poses a sequence of unconstrained optimization problems with mechanisms to control the quality of the approximation for the Hessian matrix, which is expressed in terms of the constraint functions and their first derivatives. The unconstrained problems are solved using a modified Newton's algorithm. The method is particularly applicable to solution techniques where an approximate analysis step has to be used (e.g., constraint approximations, etc.), which often results in the violation of the constraints. The generalized penalty formulation contains two floating parameters, which are used to meet the penalty requirements and to control the errors in the approximation of the Hessian matrix. A third parameter is used to vary the class of standard barrier or quasibarrier functions, forming a branch of the variable penalty formulation. Several possibilities for choosing such floating parameters are discussed. The numerical effectiveness of this algorithm is demonstrated on a relatively large set of test examples.The author is thankful for the constructive suggestions of the referees. 相似文献
13.
A penalty function-based differential evolution algorithm for constrained global optimization 总被引:1,自引:0,他引:1
We propose a differential evolution-based algorithm for constrained global optimization. Although differential evolution has been used as the underlying global solver, central to our approach is the penalty function that we introduce. The adaptive nature of the penalty function makes the results of the algorithm mostly insensitive to low values of the penalty parameter. We have also demonstrated both empirically and theoretically that the high value of the penalty parameter is detrimental to convergence, specially for functions with multiple local minimizers. Hence, the penalty function can dispense with the penalty parameter. We have extensively tested our penalty function-based DE algorithm on a set of 24 benchmark test problems. Results obtained are compared with those of some recent algorithms. 相似文献
14.
《Optimization》2012,61(6):713-726
We describe a reduction algorithm for solving semi-infinite programming problems. The proposed algorithm uses the simulated annealing method equipped with a function stretching as a multi-local procedure, and a penalty technique for the finite optimization process. An exponential penalty merit function is reduced along each search direction to ensure convergence from any starting point. Our preliminary numerical results seem to show that the algorithm is very promising in practice. 相似文献
15.
Zhiqing Meng Chuangyin Dang Min Jiang Xinsheng Xu Rui Shen 《Journal of Global Optimization》2013,56(2):691-711
Penalty function is an important tool in solving many constrained optimization problems in areas such as industrial design and management. In this paper, we study exactness and algorithm of an objective penalty function for inequality constrained optimization. In terms of exactness, this objective penalty function is at least as good as traditional exact penalty functions. Especially, in the case of a global solution, the exactness of the proposed objective penalty function shows a significant advantage. The sufficient and necessary stability condition used to determine whether the objective penalty function is exact for a global solution is proved. Based on the objective penalty function, an algorithm is developed for finding a global solution to an inequality constrained optimization problem and its global convergence is also proved under some conditions. Furthermore, the sufficient and necessary calmness condition on the exactness of the objective penalty function is proved for a local solution. An algorithm is presented in the paper in finding a local solution, with its convergence proved under some conditions. Finally, numerical experiments show that a satisfactory approximate optimal solution can be obtained by the proposed algorithm. 相似文献
16.
17.
在本文中,我们提出了带不等式约束的非线性规划问题的一类新的罚函数,它的一个子类可以光滑逼近$l_1$罚函数.
基于此类新的罚函数我们给出了一种罚算法,这个算法的特点是每次迭代求出罚函数的全局精确解或非精确解.
在很弱的条件下算法总是可行的.
我们在不需要任何约束规范的情况下,证明了算法的全局收敛性.
最后给出了数值实验. 相似文献
18.
Zhiqing Meng Chuangyin Dang Min Jiang Rui Shen 《Numerical Functional Analysis & Optimization》2013,34(7):806-820
In this article, a smoothing objective penalty function for inequality constrained optimization problems is presented. The article proves that this type of the smoothing objective penalty functions has good properties in helping to solve inequality constrained optimization problems. Moreover, based on the penalty function, an algorithm is presented to solve the inequality constrained optimization problems, with its convergence under some conditions proved. Two numerical experiments show that a satisfactory approximate optimal solution can be obtained by the proposed algorithm. 相似文献
19.
Min Jiang Rui Shen Xinsheng Xu Zhiqing Meng 《Numerical Functional Analysis & Optimization》2013,34(3):294-309
In this article, a novel objective penalty function as well as its second-order smoothing is introduced for constrained optimization problems (COP). It is shown that an optimal solution to the second-order smoothing objective penalty optimization problem is an optimal solution to the original optimization problem under some mild conditions. Based on the second-order smoothing objective penalty function, an algorithm that has better convergence is introduced. Numerical examples illustrate that this algorithm is efficient in solving COP. 相似文献
20.
A second-order smooth penalty function algorithm for constrained optimization problems 总被引:1,自引:0,他引:1
Xinsheng Xu Zhiqing Meng Jianwu Sun Liguo Huang Rui Shen 《Computational Optimization and Applications》2013,55(1):155-172
This paper introduces a second-order differentiability smoothing technique to the classical l 1 exact penalty function for constrained optimization problems(COP). Error estimations among the optimal objective values of the nonsmooth penalty problem, the smoothed penalty problem and the original optimization problem are obtained. Based on the smoothed problem, an algorithm for solving COP is proposed and some preliminary numerical results indicate that the algorithm is quite promising. 相似文献