Quadratic Programming Solver for Large-Scale Structural Optimization using SQP Algorithm

2009 ◽  
Author(s):  
B. Horowitz ◽  
S.M.B. Afonso
Keyword(s):  
Quadratic Programming ◽  
Structural Optimization ◽  
Large Scale ◽  
Sqp Algorithm

Method based on dual-quadratic programming for frame structural optimization with large scale

2006 ◽  
Vol 27 (3) ◽  
pp. 383-391
Author(s):  
Yun-kang Sui ◽  
Jia-zheng Du ◽  
Ying-qiao Guo
Keyword(s):  
Quadratic Programming ◽  
Structural Optimization ◽  
Large Scale

Large scale structural optimization of trimetallic Cu–Au–Pt clusters up to 147 atoms

2017 ◽  
Vol 686 ◽  
pp. 103-110 ◽  
Author(s):  
Genhua Wu ◽  
Yan Sun ◽  
Xia Wu ◽  
Run Chen ◽  
Yan Wang
Keyword(s):  
Structural Optimization ◽  
Large Scale

scholarly journals Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization

2020 ◽  
Author(s):  
Krešimir Mihić ◽  
Mingxi Zhu ◽  
Yinyu Ye
Keyword(s):  
Quadratic Programming ◽  
Large Scale ◽  
Optimization Problems ◽  
Quadratic Optimization ◽  
Alternating Direction Method ◽  
Convex Quadratic Programming ◽  
Method Of Multipliers ◽  
Numerical Tests ◽  
Alternating Direction ◽  
Decision Variables

Abstract The Alternating Direction Method of Multipliers (ADMM) has gained a lot of attention for solving large-scale and objective-separable constrained optimization. However, the two-block variable structure of the ADMM still limits the practical computational efficiency of the method, because one big matrix factorization is needed at least once even for linear and convex quadratic programming. This drawback may be overcome by enforcing a multi-block structure of the decision variables in the original optimization problem. Unfortunately, the multi-block ADMM, with more than two blocks, is not guaranteed to be convergent. On the other hand, two positive developments have been made: first, if in each cyclic loop one randomly permutes the updating order of the multiple blocks, then the method converges in expectation for solving any system of linear equations with any number of blocks. Secondly, such a randomly permuted ADMM also works for equality-constrained convex quadratic programming even when the objective function is not separable. The goal of this paper is twofold. First, we add more randomness into the ADMM by developing a randomly assembled cyclic ADMM (RAC-ADMM) where the decision variables in each block are randomly assembled. We discuss the theoretical properties of RAC-ADMM and show when random assembling helps and when it hurts, and develop a criterion to guarantee that it converges almost surely. Secondly, using the theoretical guidance on RAC-ADMM, we conduct multiple numerical tests on solving both randomly generated and large-scale benchmark quadratic optimization problems, which include continuous, and binary graph-partition and quadratic assignment, and selected machine learning problems. Our numerical tests show that the RAC-ADMM, with a variable-grouping strategy, could significantly improve the computation efficiency on solving most quadratic optimization problems.

Sign in / Sign up

Export Citation Format

Share Document