Results 41 to 50 of about 2,345,368 (345)
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
Nonlinear complementarity as unconstrained and constrained minimization [PDF]
Mathematical Programming, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olvi L. Mangasarian, Mikhail V. Solodov
openaire +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
Eigenvalue analysis of constrained minimization problem for homogeneous polynomial [PDF]
Journal of Global Optimization, 2013 In this paper, the concepts of Pareto H-eigenvalue and Pareto Z-eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a symmetric tensor has at
Yisheng Song, L. Qi
semanticscholar +1 more source
New iterative methods for equilibrium and constrained convex minimization problems [PDF]
, 2019 The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this paper, we combine the GPA and averaged mapping approach to propose implicit and explicit composite iterative schemes for finding ...
Maryam Yazdi
core +1 more source
Enhancing Sparsity by Reweighted ℓ1 Minimization [PDF]
, 2007 It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained ℓ1 minimization.
E. Candès, M. Wakin, Stephen P. Boyd
semanticscholar +1 more source
String-averaging projected subgradient methods for constrained minimization [PDF]
Optim. Methods Softw., 2013 We consider constrained minimization problems and propose to replace the projection onto the entire feasible region, required in the projected subgradient method, by projections onto the individual sets whose intersection forms the entire feasible region.
Y. Censor, A. Zaslavski
semanticscholar +1 more source
Project scheduling and cost minimization with multiple availability constrained resources under stochastic conditions [PDF]
, 2015 The authors propose a mathematical model to minimize the project total cost where there are multiple resources constrained by maximum availability. They assume the resources as renewable and the activities can use any subset of resources requiring any ...
Tereso, Anabela Pereira, Moutinho, Rui
core +1 more source
SVD as a preconditioner in nonlinear optimization
Computer Assisted Methods in Engineering and Science, 2017 Finding a solution of nonlinear constrained optimization problem may be very computer resources consuming, regardless of solution method adopted. A conceptually simple preconditioning procedure, based on singular value decomposition (SVD), is proposed ...
Michał Pazdanowski
doaj +1 more source
Optim. Methods Softw., 2017 We propose an algorithm for solving nonsmooth, nonconvex, constrained optimization problems as well as a new set of visualization tools for comparing the performance of optimization algorithms.
Frank E. Curtis +2 more
semanticscholar +1 more source