A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations

DOI10.1007/s10898-022-01215-2zbMath1528.90152OpenAlexW4290033653MaRDI QIDQ6064041

Jiayun Rao, Na Huang

Publication date: 8 November 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01215-2

zbMATH Keywords

projectionquasi-Newton methodDFPnonlinear monotone equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Derivative-free methods and methods using generalized derivatives (90C56) Nonlinear systems in control theory (93C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• Representations of quasi-Newton matrices and their use in limited memory methods
• An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
• A methodology for solving chemical equilibrium systems
• Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations
• A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
• A global Newton-type scheme based on a simplified Newton-type approach
• Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
• Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application
• Descent Perry conjugate gradient methods for systems of monotone nonlinear equations
• Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations
• A derivative-free iterative method for nonlinear monotone equations with convex constraints
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• A descent Dai-Liao conjugate gradient method for nonlinear equations
• Optimization theory and methods. Nonlinear programming
• Spectral gradient projection method for solving nonlinear monotone equations
• Proximal Newton-Type Methods for Minimizing Composite Functions
• Spectral DY-Type Projection Method for Nonlinear Monotone Systems of Equations
• Variable Metric Method for Minimization
• On the Convergence of a New Conjugate Gradient Algorithm
• A special newton-type optimization method
• Newton-type Methods with Generalized Distances For Constrained Optimization
• Measures for Symmetric Rank-One Updates
• A derivative‐free scaling memoryless Broyden–Fletcher–Goldfarb–Shanno method for solving a system of monotone nonlinear equations
• Nonlinear Control Synthesis by Convex Optimization
• A Rapidly Convergent Descent Method for Minimization
• A New Method of Solving Nonlinear Simultaneous Equations
• A descent family of Dai–Liao conjugate gradient methods
• Benchmarking optimization software with performance profiles.

This page was built for publication: A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations