Skip to main content
SpringerLink
Log in

Biobjective Optimization

  • Chapter
  • First Online:
Derivative-Free and Blackbox Optimization

Abstract

There are situations in which the optimization problem is driven by more than one objective function. Typically, these objectives are conflicting; for example, one may wish to maximise the solidity of a structure, while minimising its weight. In such a situation, one desires to take into account the relative tradeoffs between pairs of solutions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. M.A. Abramson, Mixed variable optimization of a Load-Bearing thermal insulation system using a filter pattern search algorithm. Optim. Eng. 5(2), 157–177 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. M.A. Abramson, C. Audet, J.W. Chrissis, J.G. Walston, Mesh adaptive direct search algorithms for mixed variable optimization. Optim. Lett. 3(1), 35–47 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. C. Audet, J.E. Dennis Jr., Pattern search algorithms for mixed variable programming. SIAM J. Optim. 11(3), 573–594 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. C. Audet, J.E. Dennis Jr., A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optim. 14(4), 980–1010 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. C. Audet, J.E. Dennis Jr., A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20(1), 445–472 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. C. Audet, V. Béchard, J. Chaouki, Spent potliner treatment process optimization using a MADS algorithm. Optim. Eng. 9(2), 143–160 (2008)

    Article  MATH  Google Scholar 

  7. C. Audet, G. Savard, W. Zghal, Multiobjective optimization through a series of single-objective formulations. SIAM J. Optim. 19(1), 188–210 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. C. Audet, G. Savard, W. Zghal, A mesh adaptive direct search algorithm for multiobjective optimization. Eur. J. Oper. Res. 204(3), 545–556 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. C. Audet, J.E. Dennis Jr., S. Le Digabel, Globalization strategies for mesh adaptive direct search. Comput. Optim. Appl. 46(2), 193–215 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. C. Audet, S. Le Digabel, M. Peyrega, Linear equalities in blackbox optimization. Comput. Optim. Appl. 61(1), 1–23 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. M. Björkman, K. Holmström, Global optimization of costly nonconvex functions using radial basis functions. Optim. Eng. 1, 373–397 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. A.J. Booker, Well-conditioned Kriging models for optimization of computer simulations. Technical Report M&CT-TECH-00-002, Boeing Computer Services, Research and Technology, M/S 7L–68, Seattle, Washington 98124 (2000)

    Google Scholar 

  13. A.J. Booker, J.E. Dennis Jr., P.D. Frank, D.W. Moore, D.B. Serafini, Managing surrogate objectives to optimize a helicopter rotor design – further experiments, in AIAA Paper 1998–4717, Presented at the 8th AIAA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, St. Louis (1998)

    Google Scholar 

  14. A.J. Booker, J.E. Dennis Jr., P.D. Frank, D.B. Serafini, V. Torczon, Optimization using surrogate objectives on a helicopter test example, in Optimal Design and Control, ed. by J. Borggaard, J. Burns, E. Cliff, S. Schreck. Progress in Systems and Control Theory (Birkhäuser, Cambridge, MA, 1998), pp. 49–58

    Google Scholar 

  15. A.J. Booker, J.E. Dennis Jr., P.D. Frank, D.B. Serafini, V. Torczon, M.W. Trosset, A rigorous framework for optimization of expensive functions by surrogates. Struct. Multidiscip. Optim. 17(1), 1–13 (1999)

    Google Scholar 

  16. X. Chen, C.T. Kelley, Optimization with hidden constraints and embedded Monte Carlo computations. Optim. Eng. 17(1), 157–175 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  17. T.D. Choi, O.J. Eslinger, C.T. Kelley, J.W. David, M. Etheridge, Optimization of automotive valve train components with implicit filtering. Optim. Eng. 1(1), 9–27 (2000)

    Article  MATH  Google Scholar 

  18. A.R. Conn, S. Le Digabel, Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim. Methods Softw. 28(1), 139–158 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  19. E.J. Cramer, J.M. Gablonsky, Effective parallel optimization of complex computer simulations, in Proceedings of the 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference (August 2004)

    Google Scholar 

  20. A.L. Custódio, J.F.A. Madeira, Glods: global and local optimization using direct search. J. Glob. Optim. 62(1), 1–28 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  21. A.L. Custódio, H. Rocha, L.N. Vicente, Incorporating minimum Frobenius norm models in direct search. Comput. Optim. Appl. 46(2), 265–278 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  22. A.L. Custódio, J.F.A. Madeira, A.I.F. Vaz, L.N. Vicente, Direct multisearch for multiobjective optimization. SIAM J. Optim. 21(3), 1109–1140 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  23. I. Das, J.E. Dennis Jr., Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631–657 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  24. J.E. Dennis Jr., V. Torczon, Managing approximation models in optimization, in Multidisciplinary Design Optimization: State of the Art, ed. by N.M. Alexandrov, M.Y. Hussaini (SIAM, Philadelphia, 1997), pp. 330–347

    Google Scholar 

  25. M. Dodangeh, L.N. Vicente, Z. Zhang, On the optimal order of worst case complexity of direct search. Optim. Lett. 10(4), 699–708 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  26. D.W. Dreisigmeyer, Direct search methods over Riemannian manifolds. Technical Report LA-UR-06-7416, Los Alamos National Laboratory, Los Alamos (2006)

    Google Scholar 

  27. D.W. Dreisigmeyer, Equality constraints, Riemannian manifolds and direct search methods. Technical Report LA-UR-06-7406, Los Alamos National Laboratory, Los Alamos (2006)

    Google Scholar 

  28. D.W. Dreisigmeyer, Direct search algorithms over Lipschitz manifolds. Technical Report LA-UR-07-1073, Los Alamos National Laboratory, Los Alamos (2007)

    Google Scholar 

  29. D.E. Finkel, C.T. Kelley, Additive scaling and the DIRECT algorithm. J. Glob. Optim. 36, 597–608 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  30. R. Fletcher, S. Leyffer, Nonlinear programming without a penalty function. Math. Program. Ser. A 91, 239–269 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  31. R. Fletcher, N.I.M. Gould, S. Leyffer, P.L. Toint, A. Wächter, On the global convergence of trust-region SQP-filter algorithms for general nonlinear programming. SIAM J. Optim. 13(3), 635–659 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  32. R. Fletcher, S. Leyffer, P.L. Toint, On the global convergence of a filter—SQP algorithm. SIAM J. Optim. 13(1), 44–59 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  33. J.M. Gablonsky, C.T. Kelley, A Locally-biased form of the DIRECT algorithm. J. Glob. Optim. 21(1), 27–37 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  34. R. Garmanjani, L.N. Vicente, Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization. IMA J. Numer. Anal. 33, 1008–1028 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  35. R. Garmanjani, D. Júdice, L.N. Vicente, Trust-region methods without using derivatives: worst case complexity and the nonsmooth case. SIAM J. Optim. 26(4), 1987–2011 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  36. R.B. Gramacy, S. Le Digabel, The mesh adaptive direct search algorithm with treed Gaussian process surrogates. Pac. J. Optim. 11(3), 419–447 (2015)

    MathSciNet  MATH  Google Scholar 

  37. S. Gratton, C.W. Royer, L.N. Vicente, A second-order globally convergent direct-search method and its worst-case complexity. Optimization 65(6), 1105–1128 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  38. G.A. Gray, T.G. Kolda, Algorithm 856: APPSPACK 4.0: asynchronous parallel pattern search for derivative-free optimization. ACM Trans. Math. Softw. 32(3), 485–507 (2006)

    Google Scholar 

  39. W.L. Hare, Y. Lucet, Derivative-free optimization via proximal point methods. J. Optim. Theory Appl. 160(1), 204–220 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  40. W. Hare, M. Macklem, Derivative-free optimization methods for finite minimax problems. Optim. Methods Softw. 28(2), 300–312 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  41. W. Hare, J. Nutini, A derivative-free approximate gradient sampling algorithm for finite minimax problems. Comput. Optim. Appl. 56(1), 1–38 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  42. M. Kokkolaras, C. Audet, J.E. Dennis Jr., Mixed variable optimization of the number and composition of heat intercepts in a thermal insulation system. Optim. Eng. 2(1), 5–29 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  43. J. Larson, M. Menickelly, S.M. Wild, Manifold sampling for ℓ 1 nonconvex optimization. SIAM J. Optim. 26(4), 2540–2563 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  44. S. Le Digabel, S.M. Wild, A taxonomy of constraints in simulation-based optimization. Technical Report G-2015-57, Les cahiers du GERAD (2015)

    Google Scholar 

  45. Q. Liu, J. Zeng, G. Yang, MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems. J. Glob. Optim. 62(2), 205–227 (2015)

    Google Scholar 

  46. G. Liuzzi, S. Lucidi, F. Rinaldi, Derivative-free methods for mixed-integer constrained optimization problems. J. Optim. Theory Appl. 164(3), 933–965 (2015)

    Google Scholar 

  47. S. Lophaven, H. Nielsen, J. Søondergaard, Dace: a matlab Kriging toolbox version 2.0. Technical Report IMM-REP-2002-12, Informatics and Mathematical Modelling, Technical University of Denmark (2002)

    Google Scholar 

  48. S. Lucidi, V. Piccialli, M. Sciandrone, An algorithm model for mixed variable programming. SIAM J. Optim. 15(4), 1057–1084 (2005)

    Google Scholar 

  49. J.M. Martínez, F.N.C. Sobral, Constrained derivative-free optimization on thin domains. J. Glob. Optim. 56(3), 1217–1232 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  50. J. Müller, MISO: mixed-integer surrogate optimization framework. Optim. Eng. 17(1), 177–203 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  51. J. Müller, C.A. Shoemaker, R. Piché, SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems. Comput. Oper. Res. 40(5), 1383–1400 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  52. R. Oeuvray, M. Bierlaire, Boosters: a derivative-free algorithm based on radial basis functions. Int. J. Model. Simul. 29(1), 26–36 (2009)

    Article  Google Scholar 

  53. E. Polak, M. Wetter, Precision control for generalized pattern search algorithms with adaptive precision function evaluations. SIAM J. Optim. 16(3), 650–669 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  54. M. Porcelli, P.L. Toint, BFO, a trainable derivative-free Brute Force Optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables. ACM Trans. Math. Softw. Article 6, 44:1, pp. 25 (2017)

    Google Scholar 

  55. R.G. Regis, Multi-objective constrained black-box optimization using radial basis function surrogates. J. Comput. Sci. 16, 140–155 (2016)

    Article  MathSciNet  Google Scholar 

  56. R.G. Regis, On the convergence of adaptive stochastic search methods for constrained and multi-objective black-box optimization. J. Optim. Theory Appl. 170(3), 932–959 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  57. R.G. Regis, C.A. Shoemaker, Constrained global optimization of expensive black box functions using radial basis functions. J. Glob. Optim. 31, 153–171 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  58. P.R. Sampaio, P.L. Toint, A derivative-free trust-funnel method for equality-constrained nonlinear optimization. Comput. Optim. Appl. 61(1), 25–49 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  59. J. Søndergaard, Optimization using surrogate models — by the space mapping technique. PhD thesis, Informatics and Mathematical Modelling, Technical University of Denmark (2003)

    Google Scholar 

  60. L.N. Vicente, Worst case complexity of direct search. EURO J. Comput. Optim. 1(1), 143–153 (2013)

    Article  MATH  Google Scholar 

  61. S.M. Wild, C.A. Shoemaker, Global convergence of radial basis function trust region derivative-free algorithms. SIAM J. Optim. 21(3), 761–781 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dépt. Mathématiques et Génie Industriel, Ecole Polytechnique de Montréal, Montréal, Québec, Canada

    Charles Audet

  2. Department of Mathematics, University of British Columbia, Kelowna, BC, Canada

    Warren Hare

Authors
  1. Charles Audet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Warren Hare
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Audet, C., Hare, W. (2017). Biobjective Optimization. In: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-68913-5_14

Download citation

Publish with us

Policies and ethics

Search

Navigation