Results 51 to 60 of about 214 (158)

Dai–Liao-type Riemannian optimization for solving the Gough–Stewart platform

EURO Journal on Computational Optimization
We introduce a class of Dai–Liao-type Riemannian conjugate gradient (CG) methods that achieve global convergence without relying on the Gauss lemma, typically invoked under strong convexity assumptions.
Nasiru Salihu, Poom Kumam, Kanokwan Sitthithakerngkiet, Supak Phiangsungnoen   +3 more
doaj   +1 more source

A New Conjugate Gradient Coefficient for Large Scale Nonlinear Unconstrained Optimization [PDF]

, 2012
Conjugate gradient (CG) methods have played an important role in solving largescale unconstrained optimization due to its low memory requirements and global convergence properties.
June, Leong Wah, Ismail Mohd, Mohd Rivaie, Mustafa Mamat, M Mamat, I Mohd, M Rivaie   +7 more
core  

An MBO method for modularity optimisation based on total variation and signless total variation

European Journal of Applied Mathematics
In network science, one of the significant and challenging subjects is the detection of communities. Modularity [1] is a measure of community structure that compares connectivity in the network with the expected connectivity in a graph sampled from a ...
Zijun Li, Yves van Gennip, Volker John
doaj   +1 more source

Consensus-based optimisation with truncated noise

European Journal of Applied Mathematics
Consensus-based optimisation (CBO) is a versatile multi-particle metaheuristic optimisation method suitable for performing non-convex and non-smooth global optimisations in high dimensions.
Massimo Fornasier, Peter Richtárik, Konstantin Riedl, Lukang Sun   +3 more
doaj   +1 more source

A Fixed Point Theorem for Discontinuous Functions [PDF]

AMS classifications: 54H25, 65K10, 49J53, 68W25Fixed point;simplicial subdivision;discontinuity ...
Herings, P.J.J., Laan, G. van der, Yang, Z.F., Talman, A.J.J.   +3 more
core  

An Iterative Procedure for Solving Nonsmooth Generalized Equation [PDF]

, 2008
2000 Mathematics Subject Classification: 47H04, 65K10.In this article, we study a general iterative procedure of the following form 0 ∈ f(xk)+F(xk+1), where f is a function and F is a set valued map acting from a Banach space X to a linear normed space Y,
Marinov, Rumen Tsanev
core  

The mathematics of adversarial attacks in AI – why deep learning is unstable despite the existence of stable neural networks

European Journal of Applied Mathematics
The unprecedented success of deep learning (DL) makes it unchallenged when it comes to classification problems. However, it is well established that the current DL methodology produces universally unstable neural networks (NNs).
Alexander Bastounis, Anders Hansen, Verner Vlačić   +2 more
doaj   +1 more source

Optimization applications of Goldbach's conjecture. [PDF]

Heliyon, 2023
Lin BMT, Lin SM, Shyu SJ.
europepmc   +1 more source

Enforcing Dirichlet boundary conditions in physics-informed neural networks and variational physics-informed neural networks. [PDF]

Heliyon, 2023
Berrone S, Canuto C, Pintore M, Sukumar N.   +3 more
europepmc   +1 more source

CALCULATING THE MAXIMUM MODULUS OF A POLYNOMIAL USING STEČKIN’S LEMMA

, 2008
. An algorithm for the calculation of the maximum modulus of a complex polynomial on the unit disc is described and evaluated. The algorithm is based on a lemma of Stečkin. Key words. Maximum modulus, polynomial, Stečkin’s lemma, von Neumann’s inequality,
J. J. Green
core