.png){kind=icon}
返回
A decomposition method for large-scale box constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.12.169.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A decomposition method for solving large-scale box constrained optimization is proposed. The algorithm is motivated by the successful use of the decomposition method presented by Joachims for training support vector machines. In particular, a new technique, based on the new definition KKT-violating index, is introduced for working set identification. Finally, the numerical experiments and implementation details show that this method is practical for large-scale problems. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Box constrained optimization
Decomposition method
Working set identification
Large-scale
KKT-violating index
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
分享收藏Origin of Structural Change Driven by A-Site Lanthanide Doping in ABO3-Type Perovskite Ferroelectrics.png)
Crystals
OAAI
CrystalsIF0
OAAI分享收藏Applying and Comparing LSTM and ARIMA to Predict CO Levels for a Time-Series Measurements in a Port AreaSignals
OAAI
SignalsIF0
OAAI分享收藏COLD FLUIDS IMPROVE EXERCISE PERFORMANCE IN THE HEAT BY SLOWING THE RATE OF HEAT GAIN冷流体通过减慢热量获取速率来改善热环境中的运动表现OAAI
OAAI分享收藏
查看更多内容