發(fā)布時間：2018-07-01 09:08

  本文選題：二階錐規(guī)劃 + 線性規(guī)劃�。� 參考：《內(nèi)蒙古大學(xué)》2017年碩士論文

【摘要】：線性規(guī)劃問題是研究變量在仿射集和凸多面體交集上的一類凸優(yōu)化問題.作為線性規(guī)劃的推廣,二階錐規(guī)劃也是一類凸優(yōu)化問題,它是在一個仿射子空間和有限個二階錐的笛卡爾乘積的交集上極大化或極小化一個線性函數(shù).許多數(shù)學(xué)規(guī)劃問題,都可以轉(zhuǎn)化為二階錐問題求解.線性規(guī)劃和二階錐規(guī)劃在工程、控制與設(shè)計(jì)等諸多領(lǐng)域的廣泛應(yīng)用,使其成為數(shù)學(xué)規(guī)劃的一個重要研究方向.本文主要研究線性規(guī)劃和二階錐規(guī)劃的光滑牛頓法.全文共分為四章.第一章,介紹線性規(guī)劃和二階錐規(guī)劃的研究背景及現(xiàn)狀.第二章,通過光滑逼近Fischer-Burmeister函數(shù),構(gòu)造出一個新的光滑函數(shù),得出該函數(shù)的連續(xù)可微性.基此給出一個求解線性規(guī)劃問題的光滑牛頓法.此外,證明了算法的全局收斂性.在解點(diǎn)處雅可比矩陣可逆的條件下,得到算法的二次收斂速度.最后通過數(shù)值實(shí)驗(yàn)證明了算法的有效性.第三章,通過對稱擾動Fischer-Burmeister函數(shù),提出一個新的互補(bǔ)函數(shù).基于該函數(shù),把二階錐規(guī)劃問題轉(zhuǎn)化為一個參數(shù)化的光滑方程組,并利用光滑牛頓法求解.此外,證明了算法的全局收斂性.在解點(diǎn)處雅可比矩陣可逆的條件下,得到算法的二次收斂速度.最后進(jìn)行數(shù)值實(shí)驗(yàn),數(shù)值結(jié)果表明了算法的有效性.第四章是對本文的總結(jié).
[Abstract]:Linear programming problem is a class of convex optimization problems for variables on affine sets and convex polyhedron intersection. As a generalization of linear programming, second-order cone programming is also a class of convex optimization problems. It is a linear function that is maximized or minimized on the intersection of the Cartesian product of an affine subspace and the finite second-order cone. Many mathematical programming problems can be transformed into second-order cone problems. Linear programming and second-order cone programming are widely used in many fields such as engineering, control and design, which make them become an important research direction of mathematical programming. In this paper, the smooth Newton method for linear programming and second order cone programming is studied. The full text is divided into four chapters. The first chapter introduces the research background and present situation of linear programming and second-order cone programming. In chapter 2, a new smooth function is constructed by smoothing the Fischer-Burmeister function, and the continuous differentiability of the function is obtained. Based on this, a smooth Newton method for solving linear programming problems is given. In addition, the global convergence of the algorithm is proved. The quadratic convergence rate of the algorithm is obtained under the condition that Jacobian matrix is reversible at the solution point. Finally, the effectiveness of the algorithm is proved by numerical experiments. In chapter 3, a new complementary function is proposed by symmetric perturbation Fischer-Burmeister function. Based on this function, the second order cone programming problem is transformed into a parameterized smooth equation system and solved by the smooth Newton method. In addition, the global convergence of the algorithm is proved. The quadratic convergence rate of the algorithm is obtained under the condition that Jacobian matrix is reversible at the solution point. Finally, numerical experiments are carried out, and the numerical results show the effectiveness of the algorithm. The fourth chapter is the summary of this paper.
【學(xué)位授予單位】：內(nèi)蒙古大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：O221

【參考文獻(xiàn)】

相關(guān)期刊論文 前2條

1 遲曉妮;劉三陽;;AN INFEASIBLE-INTERIOR-POINT PREDICTOR-CORRECTOR ALGORITHM FOR THE SECOND-ORDER CONE PROGRAM[J];Acta Mathematica Scientia;2008年03期

2 遲曉妮;劉三陽;穆學(xué)文;王淑華;;二次錐規(guī)劃的一種非精確不可行內(nèi)點(diǎn)算法[J];工程數(shù)學(xué)學(xué)報(bào);2006年04期

相關(guān)博士學(xué)位論文 前3條

1 湯京永;二階錐規(guī)劃的若干算法研究[D];上海交通大學(xué);2012年

2 房亮;二階錐規(guī)劃和二階錐互補(bǔ)問題的算法研究[D];上海交通大學(xué);2010年

3 遲曉妮;二次錐規(guī)劃的算法研究[D];西安電子科技大學(xué);2008年

，

本文編號：2087275