Results 51 to 60 of about 6,104 (162)
A finite steps algorithm for solving convex feasibility problems
Journal of Global Optimization, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rami, M. Ait, Helmke, Uwe, Moore, John
openaire +2 more sources
Viability and Feasibility of Constrained Kinematic Control of Manipulators
Robotics, 2018 Recent advances in planning and control of robot manipulators make an increasing use of optimization-based techniques, such as model predictive control. In this framework, ensuring the feasibility of the online optimal control problem is a key issue.
Marco Faroni +3 more
doaj +1 more source
Distributed Algorithms for Solving a Class of Convex Feasibility Problems
CoRR, 2016 In this paper, a class of convex feasibility problems (CFPs) are studied for multi-agent systems through local interactions. The objective is to search a feasible solution to the convex inequalities with some set constraints in a distributed manner.
Kaihong Lu +2 more
openaire +2 more sources
MathematicsThis paper presents a synthesis of higher-order control Lyapunov functions (HOCLFs) and higher-order control barrier functions (HOCBFs) capable of controlling nonlinear dynamic systems while maintaining safety.
Alaa Eddine Chriat, Chuangchuang Sun
doaj +1 more source
A General Approximation Method for a Kind of Convex Optimization Problems in Hilbert Spaces
Journal of Applied Mathematics, 2014 The constrained convex minimization problem is to find a point x∗ with the property that x∗∈C, and h(x∗)=min h(x), ∀x∈C, where C is a nonempty, closed, and convex subset of a real Hilbert space H, h(x) is a real-valued convex function, and h(x) is not ...
Ming Tian, Li-Hua Huang
doaj +1 more source
Advances in Mechanical Engineering, 2017 This article presents a new output feedback controller design method for polynomial linear parameter varying model with bounded parameter variation rate.
Xiaobao Han +3 more
doaj +1 more source
Journal of Inequalities and Applications, 2018 In this paper, we present two iterative algorithms for approximating a solution of the split feasibility problem on zeros of a sum of monotone operators and fixed points of a finite family of nonexpansive mappings.
Narin Petrot +2 more
doaj +1 more source
Abstract and Applied Analysis, 2014 The two-operator split common fixed point problem (two-operator SCFP) with firmly nonexpansive mappings is investigated in this paper. This problem covers the problems of split feasibility, convex feasibility, and equilibrium and can especially be used ...
Chung-Chien Hong, Young-Ye Huang
doaj +1 more source
Convergence analysis of a variable metric forward–backward splitting algorithm with applications
Journal of Inequalities and Applications, 2019 The forward–backward splitting algorithm is a popular operator-splitting method for solving monotone inclusion of the sum of a maximal monotone operator and an inverse strongly monotone operator.
Fuying Cui, Yuchao Tang, Chuanxi Zhu
doaj +1 more source
An interior points algorithm for the convex feasibility problem
Advances in Applied Mathematics, 1983 AbstractThe problem of finding a point in the intersection of a finite family of convex sets in the Euclidean space R″ is considered here. We present a general algorithmic scheme which employs projections onto separating hyperplanes instead of projections onto the convex sets.
Aharoni, Ron +2 more
openaire +2 more sources