Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

  • Christian Günther
  • Alexandru Orzan
  • Radu Precup

Organisationseinheiten

Externe Organisationen

  • Babeș-Bolyai University (UBB)
  • Technical University of Cluj-Napoca
  • Romanian Academy
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)3323-3337
Seitenumfang15
FachzeitschriftOPTIMIZATION
Jahrgang73
Ausgabenummer11
Frühes Online-Datum11 Sept. 2023
PublikationsstatusVeröffentlicht - 2024

Abstract

The paper deals with fractional optimization problems where the objective function (ratio of two functions) is defined on a Cartesian product of two real normed spaces X and Y. Within this framework, we are interested to determine the so-called partial minimizers, i.e. points in (Formula presented.) with the property that any of its variables minimizes the objective function, restricted to this variable, with respect to the other one. While any global minimizer is obviously a partial minimizer, the reverse implication holds true only under additional assumptions (e.g. separability properties of the involved functions). By exploiting the particularities of the objective function, we deliver a Dinkelbach type algorithm for computing partial minimizers of fractional optimization problems. Further assumptions on the involved spaces and functions, such as Lipschitz-type continuity, partial Fréchet differentiability, and coercivity, enable us to establish the convergence of our algorithm to a partial minimizer.

ASJC Scopus Sachgebiete

Zitieren

Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems. / Günther, Christian; Orzan, Alexandru; Precup, Radu.
in: OPTIMIZATION, Jahrgang 73, Nr. 11, 2024, S. 3323-3337.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Günther C, Orzan A, Precup R. Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems. OPTIMIZATION. 2024;73(11):3323-3337. Epub 2023 Sep 11. doi: 10.1080/02331934.2023.2256750
Günther, Christian ; Orzan, Alexandru ; Precup, Radu. / Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems. in: OPTIMIZATION. 2024 ; Jahrgang 73, Nr. 11. S. 3323-3337.
Download
@article{09a85a7d2c8f449988f7651eb9bd1b0a,
title = "Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems",
abstract = "The paper deals with fractional optimization problems where the objective function (ratio of two functions) is defined on a Cartesian product of two real normed spaces X and Y. Within this framework, we are interested to determine the so-called partial minimizers, i.e. points in (Formula presented.) with the property that any of its variables minimizes the objective function, restricted to this variable, with respect to the other one. While any global minimizer is obviously a partial minimizer, the reverse implication holds true only under additional assumptions (e.g. separability properties of the involved functions). By exploiting the particularities of the objective function, we deliver a Dinkelbach type algorithm for computing partial minimizers of fractional optimization problems. Further assumptions on the involved spaces and functions, such as Lipschitz-type continuity, partial Fr{\'e}chet differentiability, and coercivity, enable us to establish the convergence of our algorithm to a partial minimizer.",
keywords = "coercive function, Dinkelbach type algorithm, Fractional optimization, partial minimizer",
author = "Christian G{\"u}nther and Alexandru Orzan and Radu Precup",
note = "Publisher Copyright: {\textcopyright} 2023 Informa UK Limited, trading as Taylor & Francis Group.",
year = "2024",
doi = "10.1080/02331934.2023.2256750",
language = "English",
volume = "73",
pages = "3323--3337",
journal = "OPTIMIZATION",
issn = "0233-1934",
publisher = "Taylor and Francis Ltd.",
number = "11",

}

Download

TY - JOUR

T1 - Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems

AU - Günther, Christian

AU - Orzan, Alexandru

AU - Precup, Radu

N1 - Publisher Copyright: © 2023 Informa UK Limited, trading as Taylor & Francis Group.

PY - 2024

Y1 - 2024

N2 - The paper deals with fractional optimization problems where the objective function (ratio of two functions) is defined on a Cartesian product of two real normed spaces X and Y. Within this framework, we are interested to determine the so-called partial minimizers, i.e. points in (Formula presented.) with the property that any of its variables minimizes the objective function, restricted to this variable, with respect to the other one. While any global minimizer is obviously a partial minimizer, the reverse implication holds true only under additional assumptions (e.g. separability properties of the involved functions). By exploiting the particularities of the objective function, we deliver a Dinkelbach type algorithm for computing partial minimizers of fractional optimization problems. Further assumptions on the involved spaces and functions, such as Lipschitz-type continuity, partial Fréchet differentiability, and coercivity, enable us to establish the convergence of our algorithm to a partial minimizer.

AB - The paper deals with fractional optimization problems where the objective function (ratio of two functions) is defined on a Cartesian product of two real normed spaces X and Y. Within this framework, we are interested to determine the so-called partial minimizers, i.e. points in (Formula presented.) with the property that any of its variables minimizes the objective function, restricted to this variable, with respect to the other one. While any global minimizer is obviously a partial minimizer, the reverse implication holds true only under additional assumptions (e.g. separability properties of the involved functions). By exploiting the particularities of the objective function, we deliver a Dinkelbach type algorithm for computing partial minimizers of fractional optimization problems. Further assumptions on the involved spaces and functions, such as Lipschitz-type continuity, partial Fréchet differentiability, and coercivity, enable us to establish the convergence of our algorithm to a partial minimizer.

KW - coercive function

KW - Dinkelbach type algorithm

KW - Fractional optimization

KW - partial minimizer

UR - http://www.scopus.com/inward/record.url?scp=85170687202&partnerID=8YFLogxK

U2 - 10.1080/02331934.2023.2256750

DO - 10.1080/02331934.2023.2256750

M3 - Article

AN - SCOPUS:85170687202

VL - 73

SP - 3323

EP - 3337

JO - OPTIMIZATION

JF - OPTIMIZATION

SN - 0233-1934

IS - 11

ER -