Computational performance of a projection and rescaling algorithm.

OPTIMIZATION METHODS & SOFTWARE(2021)

引用 3|浏览1
暂无评分
摘要
This paper documents a computational implementation of a {em projection and rescaling algorithm} for finding most interior solutions to the pair of feasibility problems [ text{find} ; xin Lcapmathbb{R}^n_{+} ;;;; text{ and } ; ;;;; text{find} ; hat xin L^perpcapmathbb{R}^n_{+}, ] where $L$ denotes a linear subspace in $mathbb{R}^n$ and $L^perp$ denotes its orthogonal complement. The projection and rescaling algorithm is a recently developed method that combines a {em basic procedure} involving only low-cost operations with a periodic {em rescaling step.} We give a full description of a MATLAB implementation of this algorithm and present multiple sets of numerical experiments on synthetic problem instances with varied levels of conditioning. computational experiments provide promising evidence of the effectiveness of the projection and rescaling algorithm. Our MATLAB code is publicly available. Furthermore, the simplicity of the algorithm makes a computational implementation in other environments completely straightforward.
更多
查看译文
关键词
Projection,rescaling,relative interior
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要