Results 31 to 40 of about 231,170 (284)
A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
Journal of Applied Mathematics, 2012 It is well known that the gradient-projection algorithm (GPA) is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient ...
Ming Tian, Min-Min Li
doaj +1 more source
Non-Convex Split Feasibility Problems: Models, Algorithms and Theory
Open Journal of Mathematical Optimization, 2020 In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantages in different settings of the ...
Gibali, Aviv +2 more
doaj +1 more source
On Recovery of Sparse Signals via $\ell_1$ Minimization [PDF]
, 2008 This article considers constrained $\ell_1$ minimization methods for the recovery of high dimensional sparse signals in three settings: noiseless, bounded error and Gaussian noise.
Cai, T. Tony, Xu, Guangwu, Zhang, Jun
core +3 more sources
Abstract and Applied Analysis, 2014 As is known, the regularization method plays an important role in solving constrained convex minimization problems. Based on the idea of regularization, implicit and explicit iterative algorithms are proposed in this paper and the sequences generated by ...
Ming Tian, Jun-Ying Gong
doaj +1 more source
OPTIMASS: A Package for the Minimization of Kinematic Mass Functions with Constraints [PDF]
, 2015 Reconstructed mass variables, such as $M_2$, $M_{2C}$, $M_T^\star$, and $M_{T2}^W$, play an essential role in searches for new physics at hadron colliders.
Cho, Won Sang +7 more
core +2 more sources
Minimal curvature-constrained networks [PDF]
Journal of Global Optimization, 2018 This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterative method for doing so in 3D space. Such a network will be referred to as a minimum Dubins network, since its edges are Dubins paths (or slight variants thereof). The problem
D. Kirszenblat +5 more
openaire +3 more sources
Constrained Texture Synthesis via Energy Minimization [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2007 This paper describes CMS (constrained minimization synthesis), a fast, robust texture synthesis algorithm that creates output textures while satisfying constraints. We show that constrained texture synthesis can be posed in a principled way as an energy minimization problem that requires balancing two measures of quality: constraint satisfaction and ...
Ganesh, Ramanarayanan, Kavita, Bala
openaire +2 more sources
Solving Composite Fixed Point Problems with Block Updates
Advances in Nonlinear Analysis, 2021 Various strategies are available to construct iteratively a common fixed point of nonexpansive operators by activating only a block of operators at each iteration.
Combettes Patrick L., Glaudin Lilian E.
doaj +1 more source
IEEE Transactions on Neural Systems and Rehabilitation Engineering, 2022 Replicating natural postures of human arms is essential to generate human-like behaviors in robotic applications for humans nearby. However, how to realize this requirement in interactive scenarios remains a challenge due to the kinematic redundancy and ...
Quanlin Li +5 more
doaj +1 more source
Large volume minimizers of a non local isoperimetric problem: theoretical and numerical approaches [PDF]
, 2018 We consider the volume-constrained minimization of the sum of the perimeter and the Riesz potential. We add an external potential of the form $\|x\|^{\beta}$ that provides the existence of a minimizer for any volume constraint, and we study the geometry ...
Générau, François, Oudet, Edouard
core +2 more sources