An alternating direction method for solving a class of inverse semi-definite quadratic programming problems

2015 ◽  
Vol 12 (1) ◽  
pp. 317-336 ◽  
Author(s):  
Li-Wei Zhang ◽  
Ying-En Ge ◽  
Yue Lu
Keyword(s):  
Quadratic Programming ◽  
Alternating Direction Method ◽  
Alternating Direction ◽  
Quadratic Programming Problems

scholarly journals The PPADMM Method for Solving Quadratic Programming Problems

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 941
Author(s):  
Hai-Long Shen ◽  
Xu Tang
Keyword(s):  
Quadratic Programming ◽  
Alternating Direction Method ◽  
Equality Constraint ◽  
Matrix Analysis ◽  
Method Of Multipliers ◽  
Numerical Examples ◽  
Alternating Direction ◽  
Quadratic Programming Problems ◽  
Proximal Alternating Direction Method

In this paper, a preconditioned and proximal alternating direction method of multipliers (PPADMM) is established for iteratively solving the equality-constraint quadratic programming problems. Based on strictly matrix analysis, we prove that this method is asymptotically convergent. We also show the connection between this method with some existing methods, so it combines the advantages of the methods. Finally, the numerical examples show that the algorithm proposed is efficient, stable, and flexible for solving the quadratic programming problems with equality constraint.

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.

scholarly journals An Alternating Direction Method for Convex Quadratic Second-Order Cone Programming with Bounded Constraints

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Xuewen Mu ◽  
Yaling Zhang
Keyword(s):  
Quadratic Programming ◽  
Metric Projection ◽  
Alternating Direction Method ◽  
Second Order ◽  
Primal Problem ◽  
Cone Programming ◽  
Second Order Cone Programming ◽  
Bounded Set ◽  
Second Order Cone ◽  
Alternating Direction

An alternating direction method is proposed for convex quadratic second-order cone programming problems with bounded constraints. In the algorithm, the primal problem is equivalent to a separate structure convex quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.

Sign in / Sign up

Export Citation Format

Share Document