• 作者： 朱亮儒
• 作者服務機構： 台灣師範大學數學系
• 中文摘要： 本文描述一個解非線性規劃的勢遞減內點法，並分析探討其運算次數（arithmetic operation）之複雜性（complexity）。其結果應用在凸二次規劃或線性規劃問題時是最理想化的。
• 英文摘要： A new potential reduction algorithm for solving smooth convex programming is analyzed. Undera kind of strict feasibility assumption, we show that the algorithm under modification requires a total ofO((p-n)）number of iterations, and that the total arithmetic operations are not more than O(nl), wheren +√2-n p2 n and I is the initial input size. As an application for usual linear or convex quadraticprogramming, this algorithm solves the pair of primal and dual problems in at most 0((p-n)L) iterations,and the total arithmetic operations are shown to be on the order of O(n3L), where L is the input size.
• 中文關鍵字： potential reduction algorithm;strict feasibility; smooth convex programming; arithmetic operation
• 英文關鍵字： --