正规化(语言学)
财产(哲学)
趋同(经济学)
数学
最优化问题
特征向量
班级(哲学)
应用数学
块(置换群论)
数学优化
基数(数据建模)
约束(计算机辅助设计)
收敛速度
约束优化问题
计算机科学
组合数学
频道(广播)
认识论
哲学
人工智能
几何学
经济
量子力学
数据挖掘
物理
经济增长
计算机网络
作者
Radu Ioan Boţ,Minh N. Dao,Guoyin Li
标识
DOI:10.48550/arxiv.2011.09782
摘要
In this paper, we consider a class of nonsmooth sum-of-ratios fractional optimization problems with block structure. This model class is ubiquitous and encompasses several important nonsmooth optimization problems in the literature. We first propose an inertial proximal block coordinate method for solving this class of problems by exploiting the underlying structure. The global convergence of our method is guaranteed under the Kurdyka--Lojasiewicz (KL) property and some mild assumptions. We then identify the explicit exponents of the KL property for three important structured fractional optimization problems. In particular, for the sparse generalized eigenvalue problem with either cardinality regularization or sparsity constraint, we show that the KL exponents are 1/2, and so, the proposed method exhibits linear convergence rate. Finally, we illustrate our theoretical results with both analytic and simulated numerical examples.
科研通智能强力驱动
Strongly Powered by AbleSci AI