基于拉格朗日对偶的一类全局优化算法

吴慧卓; 张可村

您当前的位置：

首页 >

文章列表页 >

基于拉格朗日对偶的一类全局优化算法

专题研究 | 更新时间：2025-12-08

- 基于拉格朗日对偶的一类全局优化算法
- Global Optimization Algorithm Based on Lagrangian Dual
- 西安交通大学学报 2008年42卷第8期页码：1031-1034
- 作者机构：
  
  西安交通大学理学院,西安,710049
- 作者简介：
- 基金信息：
- DOI：
  中图分类号： O221.2
- 网络首发：2008-08-10，
  
  纸质出版：2008
- 稿件说明：
移动端阅览
吴慧卓, 张可村. 基于拉格朗日对偶的一类全局优化算法[J]. 西安交通大学学报, 2008,42(8):1031-1034.

吴慧卓, 张可村. Global Optimization Algorithm Based on Lagrangian Dual[J]. 2008, 42(8): 1031-1034.
吴慧卓, 张可村. 基于拉格朗日对偶的一类全局优化算法[J]. 西安交通大学学报, 2008,42(8):1031-1034. DOI：

吴慧卓, 张可村. Global Optimization Algorithm Based on Lagrangian Dual[J]. 2008, 42(8): 1031-1034. DOI：

摘要

针对带有非凸二次函数约束的非凸二次规划问题(NQP)

提出了一个基于拉格朗日对偶的确定型全局优化算法

这类优化算法可广泛应用于工程设计和非线性系统的鲁棒稳定性分析等实际问题中.为求解此问题

首先

应用拉格朗日对偶对原问题进行下界估计.其次

为克服拉格朗日对偶问题的非凸性

利用线性化方法

得到拉格朗日对偶问题的线性下界估计

并且由此建立了NQP拉格朗日对偶问题的松弛线性规划(RLP).如此通过对RLP可行域的细分和一系列RLP的求解过程

从理论上证明了算法收敛到NQP的全局最优解.数值算例应用结果表明

该方法是可行的.

Abstract

A deterministic global optimization algorithm based on Lagrangian dual is proposed for solving the nonconvex quadratic programming with nonconvex quadratic constraints

which is often encountered in technical design and operational research. By utilizing a linearized method the difficulty that the Lagrangian dual problem is nonconvex is solved and the linearization relaxation of the Lagrangian is obtained. The proposed branch and bound algorithms are convergent to the global minimum via successive refinement of the linear relaxation of the Lagrangian dual problem and the solutions to a series of the relaxation of linear programming. Interval Newton method is used to accelerate the convergence of the algorithm. Numerical experiments are given to verify the feasibility of the proposed algorithm.

关键词

Keywords

references

KHAMMASH M H. Synthesis of globally optimal controllers for robust performance to unstructured uncertainty[J]. IEEE Transactions on Automatic Control,1996, 41(2):189-198.

SALAPAKA M V, KHAMMASH M H, VOORHIS T V.Synthesis of globally optimal controllers in h using the reformulation-linearization technique[C]∥Proceedings of the IEEE Conference on Decision and Control. Piscataway, NJ, USA: IEEE, 1998.

LODWICK W A. Preprocessing nonlinear functional constraints with applications to the pooling problem[J]. ORSA Journal on Computing,1992, 4(1):119-131.

FLOUDAS C A, VISWESWARAN V. Primal-relaxed dual global optimization approach[J]. Journal of Optimization Theory and Applications, 1993, 78:187-225.

QU S J, YIN H Y, ZHANG K C. A global optimization algorithm using linear relaxation[J].Applied Mathematics and Computation, 2006,178:510-518.

VOORHIS T V. A global optimization algorithm using Lagrangian underestimates and the interval Newton method[J]. Journal of Global Optimization, 2002,24:349-370.

PARDLOS P M, ROSEN J B. Constrained global optimization: algorithms and applications[M]. Berlin,Germany:Springer-Verlag, 1987.

AN L T H. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints[J]. Math Program: Ser A, 2000, 87(12):401-426.

KEARFOTT R B.Rigorous global search: continuous problems, nonconvex optimization and its applications[M]. Dordrecht,Holland:Kluwer Academic Publishers,1996.

MARANAS C D, FLOUDAS C A. Global optimization in generalized geometric programming[J]. Computers and Chemical Engineering,1997,21(4):351-369.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

面向Pareto最优遗传算法的服务组合方法

一种多层平面电感设计的全局优化方法

全局智能优化集成算法研究

CPU-GPU系统中基于剖分的全局性能优化方法

分布式计算系统下可分任务的周期性多趟调度