Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Signal Processing Systems"
DOI: 10.1007/s11265-020-01550-1
Abstract: NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for… read more here.
Keywords: algorithms solving; solving hard; hard problems; decomposition algorithms ... See more keywords
Modified subgradient extragradient algorithms for solving monotone variational inequalities
Sign Up to like & getrecommendations! Published in 2018 at "Optimization"
DOI: 10.1080/02331934.2018.1523404
Abstract: ABSTRACT In this paper, we introduce two new algorithms for solving classical variational inequalities problem with Lipschitz continuous and monotone mapping in real Hilbert space. We modify the subgradient extragradient methods with a new step… read more here.
Keywords: algorithms solving; subgradient extragradient; modified subgradient; variational inequalities ... See more keywords
Algorithms for solving high dimensional PDEs: from nonlinear Monte Carlo to machine learning
Sign Up to like & getrecommendations! Published in 2021 at "Nonlinearity"
DOI: 10.1088/1361-6544/ac337f
Abstract: In recent years, tremendous progress has been made on numerical algorithms for solving partial differential equations (PDEs) in a very high dimension, using ideas from either nonlinear (multilevel) Monte Carlo or deep learning. They are… read more here.
Keywords: monte carlo; algorithms solving; carlo; nonlinear monte ... See more keywords
Algorithms for solving inverse problems in the optics of layered media based on comparing the extrema of spectral characteristics
Sign Up to like & getrecommendations! Published in 2017 at "Computational Mathematics and Mathematical Physics"
DOI: 10.1134/s0965542517050025
Abstract: A new algorithm for determining the optical parameters of deposited multilayer optical coatings based on comparing the positions of the extrema of the optical characteristics of multilayer optical coatings is proposed. Two versions of this… read more here.
Keywords: algorithms solving; optics; inverse problems; solving inverse ... See more keywords
New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Mathematics"
DOI: 10.1155/2021/6624509
Abstract: The split feasibility problem has received much attention due to its various applications in signal processing and image reconstruction. In this paper, we propose two inertial relaxed algorithms for solving the split feasibility problem in… read more here.
Keywords: split feasibility; algorithms solving; inertial relaxed; solving split ... See more keywords
Self-adaptive projection algorithms for solving the split equality problems
Sign Up to like & getrecommendations! Published in 2017 at "Fixed Point Theory"
DOI: 10.24193/fpt-ro.2017.1.15
Abstract: In this paper, we first introduce a self-adaptive projection algorithm by adopting Armijolike searches to solve the spit equality problem (SEP), then we propose a relaxed self-adaptive projection algorithm by using projections onto half-spaces instead… read more here.
Keywords: algorithms solving; self adaptive; projection algorithms; adaptive projection ... See more keywords
A Review and Comparative Study of Differential Evolution Algorithms in Solving Inverse Kinematics of Mobile Manipulator
Sign Up to like & getrecommendations! Published in 2023 at "Symmetry"
DOI: 10.3390/sym15051080
Abstract: Mobile manipulator robots have become important pieces of equipment due to the high mobility of mobile subsystems and the high flexibility of manipulator subsystems. Considering the increasing degrees of freedom and the need to avoid… read more here.
Keywords: kinematics; inverse kinematics; solving inverse; manipulator ... See more keywords