Results 111 to 120 of about 827,423 (299)
Newton-type regularization methods for nonlinear inverse problems
: Inverse problems arise whenever one searches for unknown causes based on observation of their effects. Such problems are usually ill-posed in the sense that their solutions do not depend continuously on the data.
Qinian Jin
core
We present sufficient convergence conditions for two-step Newton methods in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. The advantages of our approach over other studies such as Argyros et al. (2010) [
Argyros, I.K. +1 more
core +1 more source
This study introduces a data‐driven framework that combines deep reinforcement learning with classical path planning to achieve adaptive microrobot navigation. By training a surrogate neural network to emulate microrobot dynamics, the approach improves learning efficiency, reduces training time, and enables robust real‐time obstacle avoidance in ...
Amar Salehi +3 more
wiley +1 more source
This article presents two variants of memoryless quasi-Newton methods with backtracking line search for large-scale unconstrained minimization. These updating methods are derived by means of a least-change updating strategy subjected to some weaker form ...
Keat Hee Lim, Wah June Leong
doaj +1 more source
Fully Adaptive Newton--Galerkin Methods for Semilinear Elliptic Partial Differential Equations
In this paper we develop an adaptive procedure for the numerical solution of general, semilinear elliptic problems with possible singular perturbations.
Amrein, Mario +2 more
core +1 more source
Towards Advanced Intelligent and Perceptive Soft Grippers
Implementing soft yet strong and intelligent soft grippers request innovative and creative solutions in designing soft bodies and seamlessly integrating actuated systems with hierarchical sensing. This review systematically analyses soft grippers with a deep understanding of core components, from fundamental design principles to actuation and sensing ...
Haneul Kim +4 more
wiley +1 more source
Local convergence radius for the Mann-type iteration
A procedure to estimate the local convergence radius for a Mann-type iteration is given in the setting of a finite dimensional space. In particular we obtain the estimation of radius for classical Newton method.
Măruşter Ştefan
doaj +1 more source
Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods
We consider optimality systems of Karush-Kuhn-Tucker (KKT) type, which arise, for example, as primal-dual conditions characterizing solutions of optimization problems or variational inequalities.
A.F. Izmailov +2 more
core +1 more source
Electrical impedance tomography (EIT) tactile skins enable multiplexed measurements that trade sensing speed against information richness. This work introduces an economy‐of‐touch framework that treats tactile sensing as an information‐budgeting problem.
Xiaoxian Xu, David Hardman, Fumiya Iida
wiley +1 more source
DIN: A Decentralized Inexact Newton Algorithm for Consensus Optimization
This paper tackles a challenging decentralized consensus optimization problem defined over a network of interconnected devices. The devices work collaboratively to solve a problem using only their local data and exchanging information with their ...
Abdulmomen Ghalkha +3 more
doaj +1 more source

