A randomised non-descent method for global optimisation

DOI10.1007/978-3-031-48751-4_1MaRDI QIDQ6959273zbMATH OpenFDO

Authors D. A. Pasechnyuk, Alexander Yu. Gornov

Publication date 15 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-48751-4_1

zbMATH Keywords

random subspacesubspace samplingzeroth-order optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites work

• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• A Simplex Method for Function Minimization
• A stochastic subspace approach to gradient-free optimization in high dimensions
• A taxonomy of global optimization methods based on response surfaces
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• Function minimization by conjugate gradients
• Global optimization
• Global optimization on funneling landscapes
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Proximal gradient methods with adaptive subspace sampling
• Random gradient-free minimization of convex functions
• Restart procedures for the conjugate gradient method
• Stochastic quasi-gradient methods: variance reduction via Jacobian sketching
• The conjugate gradient method in extremal problems

This page was built for publication: A randomised non-descent method for global optimisation

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