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

DOI10.1007/s42967-022-00239-5zbMATH Open1543.65092MaRDI QIDQ6575280

Howard Heaton, Stanley Osher, Samy Wu Fung

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Lipschitzian optimization without the Lipschitz constant
• Weighted essentially non-oscillatory schemes
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Subgradient methods for sharp weakly convex functions
• A stochastic subspace approach to gradient-free optimization in high dimensions
• A one-bit, comparison-based gradient estimator
• Envelopes and nonconvex Hamilton-Jacobi equations
• Deep relaxation: partial differential equations for optimizing deep neural networks
• Differential properties of the Moreau envelope
• Algorithm 909
• Two approximations of solutions of Hamilton-Jacobi equations
• High-Order Essentially Nonoscillatory Schemes for Hamilton–Jacobi Equations
• First-Order Methods in Optimization
• Stochastic Model-Based Minimization of Weakly Convex Functions
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
• Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling
• Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization
• Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization
• Benchmarking Derivative-Free Optimization Algorithms
• Derivative-free optimization methods
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Entropy-SGD: biasing gradient descent into wide valleys
• On the numerical performance of finite-difference-based methods for derivative-free optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Zeroth-order optimization with orthogonal random directions
• The Elements of Statistical Learning

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