线性超优法与线性规划对条件数增加的免疫性
Immunity to Increasing Condition Numbers of Linear Superiorization versus Linear Programming
AI总结:
研究线性规划(LP)和线性超优法(LinSup)对线性约束系统条件数增加的敏感性,通过在具有不同条件数和问题维度的线性规划问题示例数据集上进行实验,探究二者应对病态问题的优缺点。
摘要:
给定一组线性约束和一个线性目标函数,可考虑应用线性规划(LP)算法还是线性超优法(LinSup)。LP旨在找到最优解,而LinSup采用抗扰动可行性寻求算法,使迭代朝着目标函数值减小(不一定最小)的可行点进行。此前研究比较了LP和LinSup的输出及资源使用,本文研究它们对线性约束系统条件数的敏感性。条件数衡量输入数据偏差对问题输出的影响,LP和LinSup应对条件数增加(即病态问题)的能力此前未被研究。我们通过实验研究了LP和LinSup在具有多个条件数和不同问题维度的线性规划问题示例数据集上的优缺点。
英文摘要:
Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at finding an optimal point, i.e., a point that fulfills the constraints and has the minimal value of the objective function over these constraints. The Linear Superiorization approach considers the same data as in linear programming problems but instead of attempting to solve with linear programming methods it employs perturbation resilient feasibility-seeking algorithms that steer the iterations toward a feasible point with reduced (not necessarily minimal) objective function value. This aim of the superiorization method (SM) is less demanding than aiming to reach full-fledged constrained optimality and it places more importance on reaching feasibility than on reaching optimality. Previous studies (e.g., [1]) compared LP and LinSup in terms of their respective outputs and the resources they use. Here, we investigate classical LP approaches and LinSup in terms of their sensitivity to condition numbers of the system of linear constraints. Condition numbers are a measure for the impact of deviations in the input data on the output of a problem and, in particular, they describe the factor of error propagation when given wrong or erroneous data. Therefore, the ability of LP and LinSup to cope with increased condition numbers, thus with illposed problems, is an important matter to consider which was not studied until now. We investigate experimentally the advantages and disadvantages of both LP and LinSup on exemplary sets of data of problems of linear programming with multiple condition numbers and different problem dimensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。