Results 41 to 50 of about 180 (154)
combinatorial optimization, branch and bound, artificial intelligence, 65K05, 65K10,
Albert Corominas, Rafael Pastor
core +1 more source
Acceleration of Convergence in Dontchev’s Iterative Method for Solving Variational Inclusions [PDF]
, 2003 2000 Mathematics Subject Classification: 47H04, 65K10.In this paper we investigate the existence of a sequence (xk ) satisfying 0 ∈ f (xk )+ ∇f (xk )(xk+1 − xk )+ 1/2 ∇2 f (xk )(xk+1 − xk )^2 + G(xk+1 ) and converging to a solution x∗ of the generalized
Geoffroy, M., Hilout, S., Pietrus, A.
core
, 2017 A new local convergence analysis of the Gauss-Newton method for solving some optimization problems is presented using restricted convergence domains. The results extend the applicability of the Gauss-Newton method under the same computational cost given ...
ARGYROS , Ioannis K., GEORGE, Santhosh
core +1 more source
An MBO method for modularity optimisation based on total variation and signless total variation
European Journal of Applied MathematicsIn 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
Pseudomonotone operators and the Bregman Proximal Point Algorithm
Pseudomonotone operators, Variational inequalities, Bregman distances, Proximal Point algorithm, Interior-point-effect, 47J20, 65J20, 65K10, 90C26, 90C30,
Nils Langenberg
core +1 more source
Steffensen Methods for Solving Generalized Equations [PDF]
, 2008 2000 Mathematics Subject Classification: 65G99, 65K10, 47H04.We provide a local convergence analysis for Steffensen's method in order to solve a generalized equation in a Banach space setting. Using well known fixed point theorems for set-valued maps [13]
Argyros, Ioannis K., Hilout, Saïd
core
GENERALIZED NONLINEAR VARIATIONAL INEQUALITIES [PDF]
, 2014 . In this paper, we consider a generalized nonlinear variational inequality problem involving single valued and multivalued nonlinear operators. We also study criteria of its solvability. Iterative methods for approximate solution are also proposed and a
Suja Varghese, Balwant Singh Thakur
core
Consensus-based optimisation with truncated noise
European Journal of Applied MathematicsConsensus-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 +3 more
doaj +1 more source
European Journal of Applied MathematicsThe 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 +2 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 +7 more
core