Results 21 to 30 of about 511 (75)
MathematicsThis paper presents a partially symmetric regularized two-step inertial alternating direction method of multipliers for solving non-convex split feasibility problems (SFP), which adds a two-step inertial effect to each subproblem and includes an ...
Can Yang, Yazheng Dang
doaj +1 more source
Regularity at infinity of real mappings and a Morse-Sard theorem
, 2011 We prove a new Morse-Sard type theorem for the asymptotic critical values of semi-algebraic mappings and a new fibration theorem at infinity for $C^2$ mappings.
Dias, L. R. G. +2 more
core +1 more source
Demonstratio MathematicaIt is of strong theoretical significance and application prospects to explore three-block nonconvex optimization with nonseparable structure, which are often modeled for many problems in machine learning, statistics, and image and signal processing.
Zhao Ying, Lan Heng-you, Xu Hai-yang
doaj +1 more source
Data‐driven methods for quantitative imaging
GAMM-Mitteilungen, Volume 48, Issue 1, March 2025.Abstract In the field of quantitative imaging, the image information at a pixel or voxel in an underlying domain entails crucial information about the imaged matter. This is particularly important in medical imaging applications, such as quantitative magnetic resonance imaging (qMRI), where quantitative maps of biophysical parameters can characterize ...
Guozhi Dong +5 more
wiley +1 more source
On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Optimization
, 2019 Extrapolation is a well-known technique for solving convex optimization and variational inequalities and recently attracts some attention for non-convex optimization. Several recent works have empirically shown its success in some machine learning tasks.
Jin, Rong +4 more
core +1 more source
The Bregman Modified Second APG Method for DC Optimization Problems
IEEE AccessThe Difference of Convex (DC) optimization problem holds significant importance in both optimization theory and practical applications. In recent years, numerous algorithms have been developed to solve DC problems, demonstrating strong performance across
Lumiao Wang, Ziye Liu, Chunguang Liu
doaj +1 more source
A new convergence proof for the higher-order power method and generalizations [PDF]
, 2015 A proof for the point-wise convergence of the factors in the higher-order power method for tensors towards a critical point is given. It is obtained by applying established results from the theory of \L{}ojasiewicz inequalities to the equivalent ...
Uschmajew, André
core
An inverse mapping theorem for blow-Nash maps on singular spaces
, 2015 A semialgebraic map $f:X\to Y$ between two real algebraic sets is called blow-Nash if it can be made Nash (i.e. semialgebraic and real analytic) by composing with finitely many blowings-up with non-singular centers.
Campesato, Jean-Baptiste
core +3 more sources
A modified inertial proximal minimization algorithm for structured nonconvex and nonsmooth problem
Journal of Inequalities and ApplicationsWe introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems.
Zhonghui Xue, Qianfeng Ma
doaj +1 more source
Bifurcation values and monodromy of mixed polynomials
, 2012 We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case of complex ...
Chen, Ying, Tibar, Mihai
core +2 more sources