Results 11 to 20 of about 100,720,857 (158)
Inertial Newton Algorithms Avoiding Strict Saddle Points
International audienceWe study the asymptotic behavior of second-order algorithms mixing Newton's method and inertial gradient descent in non-convex landscapes.
Castera, Camille
core +3 more sources
Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients [PDF]
We consider escaping saddle points of nonconvex problems where only the function evaluations can be accessed. Although a variety of works have been proposed, the majority of them require either second or first-order information, and only a few of them ...
Xiong, Huan, Gu, Bin, Zhang, Hualin
core +1 more source
Computational form-finding methods for fabric structures [PDF]
Form-finding is a process that determines the surface configuration of a fabric structure under prestress. This process can be carried out using a variety of numerical methods, of which the most common are (a) transient stiffness, (b) force density, and (
Lewis, W. J. (Wanda J.)
core +1 more source
Second Order Saddle Points Dictate the Products of Electrocyclic Reactions [PDF]
The conventional understanding of chemical reactions, primarily focused on one-dimensional minimum energy pathways, has been expanded in recent years to include phenomena like second order saddle points or bifurcations.
Lukas, Muechler, Amir, Mirzanejad
core +1 more source
A numerical method for oscillatory integrals with coalescing saddle points [PDF]
The value of a highly oscillatory integral is typically determined asymptotically by the behaviour of the integrand near a small number of critical points.
Lejon, Nele +2 more
core +1 more source
Decentralized Distributed Optimization for Saddle Point Problems [PDF]
We consider distributed convex-concave saddle point problems over arbitrary connected undirected networks and propose a decentralized distributed algorithm for their solution.
Kovalev, Dmitry +6 more
core +1 more source
Minimax methods for finding multiple saddle critical points in Banach spaces and their applications [PDF]
This dissertation was to study computational theory and methods for ?nding multiple saddle critical points in Banach spaces. Two local minimax methods were developed for this purpose.
Yao, Xudong
core +2 more sources
Finding Multiple Saddle Points for G-differential Functionals and Defocused Nonlinear Problems [PDF]
We study computational theory and numerical methods for finding multiple unstable solutions (saddle points) for two types of nonlinear variational functionals. The first type consists of Gateaux differentiable (G-differentiable) M-type (focused) problems.
Li, Meiqin
core
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Here, we develop a high‐throughput algorithm that accelerates the elucidation of phase diagrams of topological spin textures using limited computational resources at high numerical accuracy. Applying this framework to the van der Waals magnet CrSBr, we unveiled a hierarchy of previously unknown topological textures (domain‐wall bimerons, bimeron chains,
Andrew Lyall +4 more
wiley +1 more source

