Global solutions to nonconvex problems by evolution of Hamilton-Jacobi PDEs

DOI10.1007/S42967-022-00239-5MaRDI QIDQ6575280zbMATH OpenFDO

Authors Howard Heaton, Samy Wu Fung, Stanley Osher

Publication date 19 July 2024

Published in Communications on Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

global optimizationHamilton-JacobiMoreau envelopeCole-Hopfzero-order optimizationHopf-Laxproximals

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65M99)

Recommendations

• Algorithm for overcoming the curse of dimensionality for certain non-convex Hamilton-Jacobi equations, projections and differential games
• Recent Theoretical Advances in Non-Convex Optimization
• A computational approach to non-smooth optimization by diffusion equations
• Why Do Local Methods Solve Nonconvex Problems?

Cites work

• scientific article; zbMATH DE number 3177945 (Why is no real title available?)
• scientific article; zbMATH DE number 193918 (Why is no real title available?)
• scientific article; zbMATH DE number 5681750 (Why is no real title available?)
• A one-bit, comparison-based gradient estimator
• A stochastic subspace approach to gradient-free optimization in high dimensions
• Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization
• Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
• Benchmarking Derivative-Free Optimization Algorithms
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• Deep relaxation: partial differential equations for optimizing deep neural networks
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
• Derivative-free optimization methods
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Differential properties of the Moreau envelope
• Entropy-SGD: biasing gradient descent into wide valleys
• Envelopes and nonconvex Hamilton-Jacobi equations
• Escaping strict saddle points of the Moreau envelope in nonsmooth optimization
• First-order methods in optimization
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• High-Order Essentially Nonoscillatory Schemes for Hamilton–Jacobi Equations
• Lipschitzian optimization without the Lipschitz constant
• On the numerical performance of finite-difference-based methods for derivative-free optimization
• Optimization by simulated annealing
• Proximité et dualité dans un espace hilbertien
• Stochastic model-based minimization of weakly convex functions
• Subgradient methods for sharp weakly convex functions
• The Elements of Statistical Learning
• Two approximations of solutions of Hamilton-Jacobi equations
• Weighted essentially non-oscillatory schemes
• Zeroth-order optimization with orthogonal random directions
• Zeroth-order regularized optimization (ZORO): approximately sparse gradients and adaptive sampling

This page was built for publication: Global solutions to nonconvex problems by evolution of Hamilton-Jacobi PDEs

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