Browse
Submit Data
Databases
API
Help

Dataset Information

27 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Algorithms for the common solution of the split variational inequality problems and fixed point problems with applications.

ABSTRACT: In this paper, we establish a new iterative algorithm by combining Nadezhkina and Takahashi’s modified extragradient method and Xu’s algorithm. The mentioned iterative algorithm presents the common solution of the split variational inequality problems and fixed point problems. We show that the sequence produced by our algorithm is weakly convergent. Finally, we give some applications of the main results. This article extends the previous results in this area.

SUBMITTER: Lohawech P

PROVIDER: S-EPMC6311189 | biostudies-other | 2018

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Strong convergence theorem for split monotone variational inclusion with constraints of variational inequalities and fixed point problems.

Project description:In this paper, inspired by Jitsupa et al. (J. Comput. Appl. Math. 318:293–306, 2017), we propose a general iterative scheme for finding a solution of a split monotone variational inclusion with the constraints of a variational inequality and a fixed point problem of a finite family of strict pseudo-contractions in real Hilbert spaces. Under very mild conditions, we prove a strong convergence theorem for this iterative scheme. Our result improves and extends the corresponding ones announced by some others in the earlier and recent literature.

| S-EPMC6244756 | biostudies-other

Strong convergence theorems for a class of split feasibility problems and fixed point problem in Hilbert spaces.

Project description:In this paper we consider a class of split feasibility problem by focusing on the solution sets of two important problems in the setting of Hilbert spaces. One of them is the set of zero points of the sum of two monotone operators and the other is the set of fixed points of mappings. By using the modified forward–backward splitting method, we propose a viscosity iterative algorithm. Under suitable conditions, some strong convergence theorems of the sequence generated by the algorithm to a common solution of the problem are proved. At the end of the paper, some applications and the constructed algorithm are also discussed.

| S-EPMC6208615 | biostudies-other

Dipeptide Aggregation in Aqueous Solution from Fixed Point-Charge Force Fields.

Project description:The description of aggregation processes with molecular dynamics simulations is a playground for testing biomolecular force fields, including a new generation of force fields that explicitly describe electronic polarization. In this work, we study a system consisting of 50 glycyl-l-alanine (Gly-Ala) dipeptides in solution with 1001 water molecules. Neutron diffraction experiments have shown that at this concentration, Gly-Ala aggregates into large clusters. However, general-purpose force fields in combination with established water models can fail to correctly describe this aggregation process, highlighting important deficiencies in how solute-solute and solute-solvent interactions are parametrized in these force fields. We found that even for the fully polarizable AMOEBA force field, the degree of association is considerably underestimated. Instead, a fixed point-charge approach based on the newly developed IPolQ scheme [Cerutti et al. J. Phys. Chem.2013, 117, 2328] allows for the correct modeling of the dipeptide aggregation in aqueous solution. This result should stimulate interest in novel fitting schemes that aim to improve the description of the solvent polarization effect within both explicitly polarizable and fixed point-charge frameworks.

| S-EPMC3986234 | biostudies-literature

A hybrid common fixed point theorem under certain recent properties.

Project description:We prove a common fixed point theorem for a hybrid pair of occasionally coincidentally idempotent mappings via common limit range property. Our result improves some results from the existing literature, especially the ones contained in Sintunavarat and Kumam (2009). Some illustrative and interesting examples to highlight the realized improvements are also furnished.

| S-EPMC3921952 | biostudies-other

Quantum variational algorithms are swamped with traps.

Project description:One of the most important properties of classical neural networks is how surprisingly trainable they are, though their training algorithms typically rely on optimizing complicated, nonconvex loss functions. Previous results have shown that unlike the case in classical neural networks, variational quantum models are often not trainable. The most studied phenomenon is the onset of barren plateaus in the training landscape of these quantum models, typically when the models are very deep. This focus on barren plateaus has made the phenomenon almost synonymous with the trainability of quantum models. Here, we show that barren plateaus are only a part of the story. We prove that a wide class of variational quantum models-which are shallow, and exhibit no barren plateaus-have only a superpolynomially small fraction of local minima within any constant energy from the global minimum, rendering these models untrainable if no good initial guess of the optimal parameters is known. We also study the trainability of variational quantum algorithms from a statistical query framework, and show that noisy optimization of a wide variety of quantum models is impossible with a sub-exponential number of queries. Finally, we numerically confirm our results on a variety of problem instances. Though we exclude a wide variety of quantum algorithms here, we give reason for optimism for certain classes of variational algorithms and discuss potential ways forward in showing the practical utility of such algorithms.

| S-EPMC9755303 | biostudies-literature

Some common fixed point theorems in complex valued b-metric spaces.

Project description:Azam et al. (2011), introduce the notion of complex valued metric spaces and obtained common fixed point result for mappings in the context of complex valued metric spaces. Rao et al. (2013) introduce the notion of complex valued b-metric spaces. In this paper, we generalize the results of Azam et al. (2011), and Bhatt et al. (2011), by improving the conditions of contraction to establish the existence and uniqueness of common fixed point for two self-mappings on complex valued b-metric spaces. Some examples are given to illustrate the main results.

| S-EPMC4058227 | biostudies-other

Alignment Solution for CT Image Reconstruction using Fixed Point and Virtual Rotation Axis.

Project description:Since X-ray tomography is now widely adopted in many different areas, it becomes more crucial to find a robust routine of handling tomographic data to get better quality of reconstructions. Though there are several existing techniques, it seems helpful to have a more automated method to remove the possible errors that hinder clearer image reconstruction. Here, we proposed an alternative method and new algorithm using the sinogram and the fixed point. An advanced physical concept of Center of Attenuation (CA) was also introduced to figure out how this fixed point is applied to the reconstruction of image having errors we categorized in this article. Our technique showed a promising performance in restoring images having translation and vertical tilt errors.

| S-EPMC5264594 | biostudies-literature

Nonlinear two-point boundary value problems: applications to a cholera epidemic model.

Project description:This paper is concerned primarily with constructive mathematical analysis of a general system of nonlinear two-point boundary value problem when an empirically constructed candidate for an approximate solution (quasi-solution) satisfies verifiable conditions. A local analysis in a neighbour- hood of a quasi-solution assures the existence and uniqueness of solutions and, at the same time, provides error bounds for approximate solutions. Applying this method to a cholera epidemic model, we obtain an analytical approximation of the steady-state solution with rigorous error bounds that also displays dependence on a parameter. In connection with this epidemic model, we also analyse the basic reproduction number, an important threshold quantity in the epidemiology context. Through a complex analytic approach, we determine the principal eigenvalue to be real and positive in a range of parameter values.

| S-EPMC7069490 | biostudies-literature

Variational Algorithms for Analyzing Noisy Multistate Diffusion Trajectories.

Project description:Single-particle tracking offers a noninvasive high-resolution probe of biomolecular reactions inside living cells. However, efficient data analysis methods that correctly account for various noise sources are needed to realize the full quantitative potential of the method. We report algorithms for hidden Markov-based analysis of single-particle tracking data, which incorporate most sources of experimental noise, including heterogeneous localization errors and missing positions. Compared to previous implementations, the algorithms offer significant speedups, support for a wider range of inference methods, and a simple user interface. This will enable more advanced and exploratory quantitative analysis of single-particle tracking data.

| S-EPMC6050756 | biostudies-literature

Noise-induced barren plateaus in variational quantum algorithms.

Project description:Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.

| S-EPMC8630047 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data