IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v162y2014i2d10.1007_s10957-013-0308-6.html
   My bibliography  Save this article

A Steepest Descent-Like Method for Variable Order Vector Optimization Problems

Author

Listed:
  • J. Y. Bello Cruz

    (Universidade Federal de Goiás)

  • G. Bouza Allende

    (Universidad de La Habana)

Abstract

In some applications, the comparison between two elements may depend on the point leading to the so called variable order structure. Optimality concepts may be extended to this more general framework. In this paper, we extend the steepest descent-like method for smooth unconstrained vector optimization problems under a variable order structure. Roughly speaking, we see that every accumulation point of the generated sequence satisfies a necessary first order condition. We discuss the consequence of this fact in the convex case.

Suggested Citation

  • J. Y. Bello Cruz & G. Bouza Allende, 2014. "A Steepest Descent-Like Method for Variable Order Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 371-391, August.
    • Handle: RePEc:spr:joptap:v:162:y:2014:i:2:d:10.1007_s10957-013-0308-6
    DOI: 10.1007/s10957-013-0308-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-013-0308-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-013-0308-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Guang Ya Chen & Johannes Jahn, 1998. "Optimality conditions for set-valued optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 48(2), pages 187-200, November.
    2. Alfredo N. Iusem & B. F. Svaiter & Marc Teboulle, 1994. "Entropy-Like Proximal Methods in Convex Programming," Mathematics of Operations Research, INFORMS, vol. 19(4), pages 790-814, November.
    3. Gabriele Eichfelder, 2011. "Optimal Elements in Vector Optimization with a Variable Ordering Structure," Journal of Optimization Theory and Applications, Springer, vol. 151(2), pages 217-240, November.
    4. Jörg Fliege & Benar Fux Svaiter, 2000. "Steepest descent methods for multicriteria optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 51(3), pages 479-494, August.
    5. G. Isac & C. Tammer, 2010. "Application of a Vector-Valued Ekeland-Type Variational Principle for Deriving Optimality Conditions," Springer Optimization and Its Applications, in: Panos M. Pardalos & Themistocles M. Rassias & Akhtar A. Khan (ed.), Nonlinear Analysis and Variational Problems, chapter 0, pages 343-365, Springer.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Glaydston Carvalho Bento & João Xavier Cruz Neto & Antoine Soubeyran & Valdinês Leite Sousa Júnior, 2016. "Dual Descent Methods as Tension Reduction Systems," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 209-227, October.
    2. Glaydston Carvalho Bento & Gemayqzel Bouza Allende & Yuri Rafael Leite Pereira, 2018. "A Newton-Like Method for Variable Order Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 201-221, April.
    3. Brito, A.S. & Cruz Neto, J.X. & Santos, P.S.M. & Souza, S.S., 2017. "A relaxed projection method for solving multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 256(1), pages 17-23.
    4. T. Q. Bao & B. S. Mordukhovich & A. Soubeyran, 2015. "Variational Analysis in Psychological Modeling," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 290-315, January.
    5. P. B. Assunção & O. P. Ferreira & L. F. Prudente, 2021. "Conditional gradient method for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 78(3), pages 741-768, April.
    6. Orizon P. Ferreira & Mauricio S. Louzeiro & Leandro F. Prudente, 2020. "Iteration-Complexity and Asymptotic Analysis of Steepest Descent Method for Multiobjective Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 507-533, February.
    7. Gabriele Eichfelder & Maria Pilecka, 2016. "Set Approach for Set Optimization with Variable Ordering Structures Part I: Set Relations and Relationship to Vector Approach," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 931-946, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Qu, Shaojian & Ji, Ying & Jiang, Jianlin & Zhang, Qingpu, 2017. "Nonmonotone gradient methods for vector optimization with a portfolio optimization application," European Journal of Operational Research, Elsevier, vol. 263(2), pages 356-366.
    2. Kazemi, Abolghasem & Moreno, Jovita & Iribarren, Diego, 2023. "Economic optimization and comparative environmental assessment of natural gas combined cycle power plants with CO2 capture," Energy, Elsevier, vol. 277(C).
    3. Ellen H. Fukuda & L. M. Graña Drummond & Fernanda M. P. Raupp, 2016. "An external penalty-type method for multicriteria," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 493-513, July.
    4. Christian Sommer, 2014. "Geometrical and Topological Properties of a Parameterized Binary Relation in Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 815-840, December.
    5. Thai Chuong, 2013. "Newton-like methods for efficient solutions in vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 495-516, April.
    6. Morovati, Vahid & Pourkarimi, Latif, 2019. "Extension of Zoutendijk method for solving constrained multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 44-57.
    7. Gabriele Eichfelder & Maria Pilecka, 2016. "Set Approach for Set Optimization with Variable Ordering Structures Part II: Scalarization Approaches," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 947-963, December.
    8. Suthep Suantai & Kunrada Kankam & Prasit Cholamjiak, 2021. "A Projected Forward-Backward Algorithm for Constrained Minimization with Applications to Image Inpainting," Mathematics, MDPI, vol. 9(8), pages 1-14, April.
    9. Miglierina, E. & Molho, E. & Recchioni, M.C., 2008. "Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization," European Journal of Operational Research, Elsevier, vol. 188(3), pages 662-682, August.
    10. Elena-Andreea Florea, 2018. "Vector Optimization Problems with Generalized Functional Constraints in Variable Ordering Structure Setting," Journal of Optimization Theory and Applications, Springer, vol. 178(1), pages 94-118, July.
    11. Erik Alex Papa Quiroz & Nancy Baygorrea Cusihuallpa & Nelson Maculan, 2020. "Inexact Proximal Point Methods for Multiobjective Quasiconvex Minimization on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 879-898, September.
    12. Kely D. V. Villacorta & Paulo R. Oliveira & Antoine Soubeyran, 2014. "A Trust-Region Method for Unconstrained Multiobjective Problems with Applications in Satisficing Processes," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 865-889, March.
    13. Papa Quiroz, E.A. & Roberto Oliveira, P., 2012. "An extension of proximal methods for quasiconvex minimization on the nonnegative orthant," European Journal of Operational Research, Elsevier, vol. 216(1), pages 26-32.
    14. Kanako Mita & Ellen H. Fukuda & Nobuo Yamashita, 2019. "Nonmonotone line searches for unconstrained multiobjective optimization problems," Journal of Global Optimization, Springer, vol. 75(1), pages 63-90, September.
    15. Regina Sandra Burachik & B. F. Svaiter, 2001. "A Relative Error Tolerance for a Family of Generalized Proximal Point Methods," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 816-831, November.
    16. Gabriele Eichfelder & Refail Kasimbeyli, 2014. "Properly optimal elements in vector optimization with variable ordering structures," Journal of Global Optimization, Springer, vol. 60(4), pages 689-712, December.
    17. P. Q. Khanh & N. D. Tuan, 2008. "Higher-Order Variational Sets and Higher-Order Optimality Conditions for Proper Efficiency in Set-Valued Nonsmooth Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 243-261, November.
    18. Miglierina Enrico & Molho Elena & Recchioni Maria Cristina, 2006. "Box-constrained vector optimization: a steepest descent method without “a priori” scalarization," Economics and Quantitative Methods qf0603, Department of Economics, University of Insubria.
    19. M. L. N. Gonçalves & F. S. Lima & L. F. Prudente, 2022. "Globally convergent Newton-type methods for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 83(2), pages 403-434, November.
    20. S. Zhu & S. Li & K. Teo, 2014. "Second-order Karush–Kuhn–Tucker optimality conditions for set-valued optimization," Journal of Global Optimization, Springer, vol. 58(4), pages 673-692, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:162:y:2014:i:2:d:10.1007_s10957-013-0308-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.