Skip to main content
Springer Nature Link
Log in

Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we propose two methods for solving unconstrained multiobjective optimization problems. First, we present a diagonal steepest descent method, in which, at each iteration, a common diagonal matrix is used to approximate the Hessian of every objective function. This method works directly with the objective functions, without using any kind of a priori chosen parameters. It is proved that accumulation points of the sequence generated by the method are Pareto-critical points under standard assumptions. Based on this approach and on the Nesterov step strategy, an improved version of the method is proposed and its convergence rate is analyzed. Finally, computational experiments are presented in order to analyze the performance of the proposed methods.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Eschenauer, H., Koski, J., Osyczka, A.: Multicriteria Design Optimization: Procedures and Applications. Springer Science & Business Media (2012)

  2. Fliege, J.: Olaf-a general modeling system to evaluate and optimize the location of an air polluting facility. OR-Spektrum 23(1), 117–136 (2001)

    Article  Google Scholar 

  3. De, P., Ghosh, J.B., Wells, C.E.: On the minimization of completion time variance with a bicriteria extension. Oper. Res. 40(6), 1148–1155 (1992)

    Article  Google Scholar 

  4. Drummond, L.G., Maculan, N., Svaiter, B.F.: On the choice of parameters for the weighting method in vector optimization. Math. Program. 111(1–2), 201–216 (2008)

    MathSciNet  MATH  Google Scholar 

  5. Fliege, J., Drummond, L.G., Svaiter, B.F.: Newton’s method for multiobjective optimization. SIAM J. Optim. 20(2), 602–626 (2009)

    Article  MathSciNet  Google Scholar 

  6. Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Springer, Berlin (2012)

    MATH  Google Scholar 

  7. Ehrgott, M.: Multicriteria Optimization, vol. 491. Springer, Berlin (2013)

    MATH  Google Scholar 

  8. Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3), 479–494 (2000)

    Article  MathSciNet  Google Scholar 

  9. Drummond, L.G., Svaiter, B.F.: A steepest descent method for vector optimization. J. Comput. Appl. Math. 175(2), 395–414 (2005)

    Article  MathSciNet  Google Scholar 

  10. Qu, S., Goh, M., Chan, F.T.: Quasi-newton methods for solving multiobjective optimization. Oper. Res. Lett. 39(5), 397–399 (2011)

    Article  MathSciNet  Google Scholar 

  11. Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate \(\text{O}(1/k^2)\). 269, 543–547 (1983)

  12. Bertsekas, D.P.: Nonlinear programming. Athena scientific Belmont (1999)

  13. Wang, J., Hu, Y., Wai, C.K.Y., Li, C., Yang, X.: Extended newton methods for multiobjective optimization: majorizing function technique and convergence analysis. SIAM J. Optim. 29(3), 2388–2421 (2019)

    Article  MathSciNet  Google Scholar 

  14. Deb, K.: Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evol. Comput. 7(3), 205–230 (1999)

    Article  Google Scholar 

  15. Jin, Y., Olhofer, M., Sendhoff, B.: Dynamic weighted aggregation for evolutionary multi-objective optimization: \(\text{ W }\)hy does it work and how? In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation pp. 1042–1049 (2001)

  16. Preuss, M., Naujoks, B., Rudolph, G.: Pareto set and \(\text{ EMOA }\) behavior for simple multimodal multiobjective functions. In: Parallel Problem Solving from Nature-PPSN IX pp. 513–522 (2006)

  17. Witting, K.: Numerical algorithms for the treatment of parametric multiobjective optimization problems and applications. Ph.D. thesis, Universitätsbibliothek (2012)

  18. Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: Empirical results. Evol. Comput. 8(2), 173–195 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Modeling, Simulation and Data Analysis (MSDA), Mohammed VI Polytechnic University, Benguerir, Morocco

    Mustapha El Moudden

  2. Polydisciplinary Faculty of Ouarzazate, Ibn Zohr University, B.P. 284, Ouarzazate, 45800, Morocco

    Abdelkrim El Mouatasim

Authors
  1. Mustapha El Moudden
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Abdelkrim El Mouatasim
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Mustapha El Moudden.

Additional information

Communicated by Xiaoqi Yang.

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

El Moudden, M., El Mouatasim, A. Accelerated Diagonal Steepest Descent Method for Unconstrained Multiobjective Optimization. J Optim Theory Appl 188, 220–242 (2021). https://doi.org/10.1007/s10957-020-01785-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-020-01785-9

Keywords

Mathematics Subject Classification