Local convergence analysis for nonisolated solutions to derivative-free methods of optimization

DOI10.1080/02331934.2025.2586210MaRDI QIDQ6876093zbMATH OpenFDO

Authors Dao Huy Cuong, Pham Duy Khanh, Boris S. Mordukhovich, Dat Ba Tran

Publication date 13 January 2026

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2025.2586210

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Cites work

• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• A Simplex Method for Function Minimization
• A theoretical and empirical comparison of gradient approximations in derivative-free optimization
• Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients
• Derivative-free and blackbox optimization
• Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
• Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Inexact proximal methods for weakly convex functions
• Inexact reduced gradient methods in nonconvex optimization
• Introduction to Derivative-Free Optimization
• Local convergence analysis of an inexact trust-region method for nonsmooth optimization
• Newton-Type Methods for Optimization and Variational Problems
• Nonlinear programming
• Numerical optimization with computational errors
• On gradients of functions definable in o-minimal structures
• On the numerical performance of finite-difference-based methods for derivative-free optimization
• Optimizing an empirical scoring function for transmembrane protein structure determination
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Randomized sketching algorithms for low-memory dynamic optimization

This page was built for publication: Local convergence analysis for nonisolated solutions to derivative-free methods of optimization

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