Globally convergent algorithms for finding zeros of duplomonotone mappings

DOI10.1007/s11590-014-0769-zzbMath1339.90311OpenAlexW2086265002WikidataQ59425313 ScholiaQ59425313MaRDI QIDQ2018870

Ronan M. T. Fleming, Francisco J. Aragón Artacho

Publication date: 25 March 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0769-z

zbMATH Keywords

global convergencebiochemical reactionsgeneralized monotonicitymonotone mappingderivative-free algorithmline search methodduplomonotone mapping

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods ⋮ Accelerating the DC algorithm for smooth functions ⋮ Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity

Cites Work

• Unnamed Item
• Handbook of generalized convexity and generalized monotonicity
• Generalized convexity and optimization. Theory and applications
• Mass conserved elementary kinetics is sufficient for the existence of a non-equilibrium steady state concentration
• Variational Analysis
• Convex analysis and monotone operator theory in Hilbert spaces