Skip to main content
Log in

Alternating direction method of multipliers as a simple effective heuristic for mixed-integer nonlinear optimization

  • BRIEF NOTE
  • Published:
Structural and Multidisciplinary Optimization Aims and scope Submit manuscript

Abstract

In this paper we propose to utilize a variation of the alternating direction method of multipliers (ADMM) as a simple heuristic for mixed-integer nonlinear optimization problems in structural optimization. Numerical experiments suggest that using multiple restarts of ADMM with random initial points often yields a reasonable solution with small computational cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Notes

  1. For S not convex, the projection of a point onto S is not necessarily unique.

  2. This projection is not necessarily unique, since a finite set Zj is nonconvex (unless it is a singleton). If there exist two elements closest to \(x_{j}^{k + 1} + {v_{j}^{k}}\), we may adopt either one.

  3. We set the emphasis mip parameter of CPLEX to 4. This option emphasizes to find hidden feasible solutions with high qualities (IBM Knowledge Center 2017). If we use the default setting, CPLEX requires much more time to find the solutions mentioned here.

References

  • Ames BPW, Hong M (2016) Alternating direction method of multipliers for penalized zero-variance discriminant analysis. Comput Optim Appl 64:725–754

    Article  MathSciNet  MATH  Google Scholar 

  • Belotti P, Kirches C, Leyffer S, Linderoth J, Luedtke J, Mahajan A (2013) Mixed-integer nonlinear optimization. Acta Numerica 22:1–131

    Article  MathSciNet  MATH  Google Scholar 

  • Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2010) Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning 3:1–122

    Article  MATH  Google Scholar 

  • Cai J, Thierauf G (1993) Discrete optimization of structures using an improved penalty function method. Eng Optim 21:293–306

    Article  Google Scholar 

  • Chartrand R, Wohlberg B (2013) A nonconvex ADMM algorithm for group sparsity with sparse groups. In: 2013 IEEE international conference on acoustics, speech and signal processing, Vancouver, pp 6009–6013

  • D’Ambrosio C, Frangioni A, Liberti L, Lodi A (2012) A storm of feasibility pumps for nonconvex MINLP. Math Program, Series B 136:375–402

    Article  MathSciNet  MATH  Google Scholar 

  • Diamond S, Takapoui R, Boyd S (2018) A general system for heuristic minimization of convex functions over non-convex sets. Optimization Methods and Software 33:165–193

    Article  MathSciNet  MATH  Google Scholar 

  • Geißler B, Morsi A, Schewe L, Schmidt M (2017) Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps. SIAM J Optim 27:1611–1636

    Article  MathSciNet  MATH  Google Scholar 

  • Groenwold AA, Stander N, Snyman JA (1999) A regional genetic algorithm for the discrete optimal design of truss structures. Int J Numer Methods Eng 44:749–766

    Article  MATH  Google Scholar 

  • He S, Prempain E, Wu QH (2004) An improved particle swarm optimizer for mechanical design optimization problems. Eng Optim 36:585–605

    Article  MathSciNet  Google Scholar 

  • IBM Knowledge Center (2017) IBM ILOG CPLEX Optimization Studio Documentation. http://www.ibm.com/support/knowledgecenter/ (Accessed October 2017)

  • Juang DS, Chang WT (2006) A revised discrete Lagrangian-based search algorithm for the optimal design of skeletal structures using available sections. Struct Multidiscip Optim 31:201–210

    Article  Google Scholar 

  • Kanno Y (2016) Mixed-integer second-order cone programming for global optimization of compliance of frame structure with discrete design variables. Struct Multidiscip Optim 54:301–316

    Article  MathSciNet  Google Scholar 

  • Kanno Y, Fujita S (to appear) Alternating direction method of multipliers for truss topology optimization with limited number of nodes: A cardinality-constrained second-order cone programming approach. Optim Eng. https://doi.org/10.1007/s11081-017-9372-3

  • Kitayama S, Arakawa M, Yamazaki K (2006) Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization. Struct Multidiscip Optim 32:191–202

    Article  MathSciNet  MATH  Google Scholar 

  • Kitayama S, Arakawa M, Yamazaki K (2012) Discrete differential evolution for mixed discrete non-linear problems. Journal of Civil Engineering and Architecture 6:594–605

    Google Scholar 

  • Lee K-M, Tsai J-T, Liu T-K, Chou J-H (2010) Improved genetic algorithm for mixed-discrete-continuous design optimization problems. Eng Optim 42:927–941

    Article  Google Scholar 

  • Li H-L, Chou C-T (1994) A global approach for nonlinear mixed discrete programming in design optimization. Eng Optim 22:109–122

    Article  Google Scholar 

  • Lu YC, Jan JC, Hung SL, Hung GH (2013) Enhancing particle swarm optimization algorithm using two new strategies for optimizing design of truss structures. Eng Optim 45:1251–1271

    Article  Google Scholar 

  • Munk DJ, Vio GA, Steven GP (2015) Topology and shape optimization methods using evolutionary algorithms: a review. Struct Multidiscip Optim 52:613–631

    Article  MathSciNet  Google Scholar 

  • Rao SS (1996) Engineering optimization: theory and practice. Wiley, New York

  • Rasmussen MH, Stolpe M (2008) Global optimization of discrete truss topology design problems using a parallel cut-and-branch method. Comput Struct 86:1527–1538

    Article  Google Scholar 

  • Sørensen SN, Stolpe M (2015) Global blending optimization of laminated composites with discrete material candidate selection and thickness variation. Struct Multidiscip Optim 52:137–155

    Article  MathSciNet  Google Scholar 

  • Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112:223–229

    Article  Google Scholar 

  • Takapoui R, Moehle N, Boyd S, Bemporad A (to appear) A simple effective heuristic for embedded mixed-integer quadratic programming. Int J Control. https://doi.org/10.1080/00207179.2017.1316016

  • The MathWorks Inc. (2017) MATLAB documentation. http://www.mathworks.com/ (Accessed October 2017

  • Thierauf G, Cai J (1998) Parallelization of the evolution strategy for discrete structural optimization problems. Comput Aided Civ Inf Eng 13:23–30

    Article  Google Scholar 

  • Zavala GR, Nebro AJ, Luna F, Coello Coello CA (2014) A survey of multi-objective metaheuristics applied to structural optimization. Struct Multidiscip Optim 49:537–558

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The work of the first author is partially supported by JSPS KAKENHI 17K06633.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yoshihiro Kanno.

Additional information

Communicated by: Qing Li

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kanno, Y., Kitayama, S. Alternating direction method of multipliers as a simple effective heuristic for mixed-integer nonlinear optimization. Struct Multidisc Optim 58, 1291–1295 (2018). https://doi.org/10.1007/s00158-018-1946-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00158-018-1946-y

Keywords

Navigation