Results 11 to 20 of about 29,427 (150)
RBCC Mid-section Combined Trajectory Optimization Method Based on Particle Swarm-Pseudospectral Convex Optimization [PDF]
In order to solve the problem of combined trajectory optimization of RBCC mid-section, a nested optimization method based on particle swarm-pseudospectral convex optimization is proposed.
Yang Yuxuan, Fei Wanghua, Liu Haili, Wang Peichen, Yan Xunliang
doaj +1 more source
Convex Matroid Optimization [PDF]
We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.
openaire +3 more sources
Bandwidth Maximization of Disturbance Observer Based on Experimental Frequency Response Data
A disturbance observer (DOB) has been widely employed in industrial field due to its simplicity and effectiveness in disturbance rejection. This paper focuses on systematic bandwidth-maximized DOB design by frequency response data-based convex ...
Xiaoke Wang +2 more
doaj +1 more source
On convex optimization without convex representation [PDF]
7 pages; 1 ...
openaire +3 more sources
Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj +1 more source
A Note on Optimality Conditions for DC Programs Involving Composite Functions
By using the formula of the ε-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained.
Xiang-Kai Sun, Hong-Yong Fu
doaj +1 more source
In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization.
Q. L. Dong +4 more
doaj +1 more source
Convex projection and convex multi-objective optimization [PDF]
AbstractIn this paper we consider a problem, called convex projection, of projecting a convex set onto a subspace. We will show that to a convex projection one can assign a particular multi-objective convex optimization problem, such that the solution to that problem also solves the convex projection (and vice versa), which is analogous to the result ...
Gabriela Kováčová, Birgit Rudloff
openaire +2 more sources
ROBOTIC MOTION PLANNING USING CONVEX OPTIMIZATION METHODS
Collision avoidance techniques tend to derive the robot away of the obstacles in minimal total travel distance. Most of the collision avoidance algorithms have trouble get stuck in a local minimum.
Thaker Nayl
doaj +1 more source
Some Inequalities of Generalized p-Convex Functions concerning Raina’s Fractional Integral Operators
Convex functions play an important role in pure and applied mathematics specially in optimization theory. In this paper, we will deal with well-known class of convex functions named as generalized p-convex functions.
Changyue Chen +2 more
doaj +1 more source

