Globally convergent algorithms for finding zeros of duplomonotone mappings

DOI10.1007/S11590-014-0769-ZMaRDI QIDQ2018870zbMATH OpenOpenAlexWikidataFDO

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

Publication date 25 March 2015

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

biochemical reactionsderivative-free algorithmduplomonotone mappinggeneralized monotonicityglobal convergenceline search methodmonotone mapping

Mathematics Subject Classification ID

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

Recommendations

• A globally convergent method for finding zeros of smooth functions
• A descent derivative-free algorithm for nonlinear monotone equations with convex constraints
• scientific article; zbMATH DE number 269562
• A double-projection-based algorithm for large-scale nonlinear systems of monotone equations
• Proximal point algorithms for finding a zero of a finite sum of monotone mappings in Banach spaces

Cites work

• Convex analysis and monotone operator theory in Hilbert spaces
• Generalized convexity and optimization. Theory and applications
• Handbook of generalized convexity and generalized monotonicity
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Mass conserved elementary kinetics is sufficient for the existence of a non-equilibrium steady state concentration
• Variational Analysis

Cited in

(6)

• Accelerating the DC algorithm for smooth functions
• Global convergence of the Durand-Kerner method applied to the equation \(z^ 3 = 0\)
• Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity
• scientific article; zbMATH DE number 3911587 (Why is no real title available?)
• Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods
• Three New Rapidly Convergent Algorithms for Finding a Zero of a Function

This page was built for publication: Globally convergent algorithms for finding zeros of duplomonotone mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018870)