Skip to main navigation Skip to search Skip to main content

Globally convergent algorithms for finding zeros of duplomonotone mappings

  • University of Luxembourg

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

4 Citations (Scopus)

Abstract

We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class of monotone mappings. We study some of the main properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally, we present three variations of a derivative-free line search algorithm for finding zeros of systems of duplomonotone equations, and we prove their linear convergence to a zero of the function.

Original languageEnglish
Pages (from-to)569-584
Number of pages16
JournalOptimization Letters
Volume9
Issue number3
DOIs
Publication statusPublished - Mar 2015
Externally publishedYes

Keywords

  • Biochemical reactions
  • Derivative-free algorithm
  • Duplomonotone mapping
  • Generalized monotonicity
  • Global convergence
  • Line search method
  • Monotone mapping

Fingerprint

Dive into the research topics of 'Globally convergent algorithms for finding zeros of duplomonotone mappings'. Together they form a unique fingerprint.

Cite this