.png){kind=icon}
Return
Parallel SSLE algorithm for large scale constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.12.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a parallel SSLE algorithm is proposed for solving large scale constrained optimization with block-separable structure. At each iteration, the PVD sub-problems are solved inexactly by the SSLE algorithm, which successfully overcomes the constraint inconsistency exited in most SQP-type algorithm, and decreases the computation amount as well. Without assuming the convexity of the constraints, the algorithm is proved to be globally convergent to a KKT point of the original problem. Crown Copyright (C) 2010 Published by Elsevier Inc. All rights reserved.
Keywords:
Parallel variable distribution
SSLE algorithm
KKT point
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveStudy on No-Insulation HTS Pancake Coils With Iron Core for Superconducting DC Induction Heaters
PREAI
ShareSaveShareSave no more
no more