Results 1 to 10 of about 1,574 (118)
Open Mathematics, 2011 In this note we provide regularity conditions of closedness type which guarantee some surjectivity results concerning the sum of two maximal monotone operators by using representative functions.
Ioan Boţ Radu, Grad Sorin-Mihai
doaj +2 more sources
Attouch-Théra Duality, Generalized Cycles, and Gap Vectors [PDF]
SIAM Journal on Optimization, 2021 Using the Attouch-Théra duality, we study the cycles, gap vectors and fixed point sets of compositions of proximal mappings. Sufficient conditions are given for the existence of cycles and gap vectors.
Salihah Alwadani +2 more
semanticscholar +1 more source
Designing experiments informed by observational studies
Journal of Causal Inference, 2021 The increasing availability of passively observed data has yielded a growing interest in “data fusion” methods, which involve merging data from observational and experimental sources to draw causal conclusions.
Rosenman Evan T. R., Owen Art B.
doaj +1 more source
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
An Efficient Nonconvex Regularization Method for Wavelet Frame Based Compressed Sensing Recovery
Journal of Computations & Modelling, 2021 In this paper, we propose a variation model which takes advantage of the wavelet tight frame and nonconvex shrinkage penalties for compressed sensing recovery.
Xiao-Juan Yang, Jin Jing
semanticscholar +1 more source
Firmly nonexpansive mappings in classes of geodesic spaces [PDF]
, 2012 Firmly nonexpansive mappings play an important role in metric fixed point theory and optimization due to their correspondence with maximal monotone operators.
David Ariza-Ruiz +2 more
semanticscholar +1 more source
A new conjugate gradient method for acceleration of gradient descent algorithms
Moroccan Journal of Pure and Applied Analysis, 2021 An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source
Intelligent Systems with Applications, 2022 We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items ...
M. Forkan, M.M. Rizvi, M.A.M. Chowdhury
doaj +1 more source
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj +1 more source
New inertial forward–backward algorithm for convex minimization with applications
Demonstratio Mathematica, 2023 In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces.
Kankam Kunrada +2 more
doaj +1 more source