Algorithms for optimization problems with exclusion constraints (Q1068724): Difference between revisions
From MaRDI portal
Latest revision as of 11:06, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for optimization problems with exclusion constraints |
scientific article |
Statements
Algorithms for optimization problems with exclusion constraints (English)
0 references
1986
0 references
This paper proposes algorithms for minimizing a continuously differentiable function f(x): \({\mathbb{R}}^ n\to {\mathbb{R}}\) subject to the constraint that x does not lie in specified bounded subsets of \({\mathbb{R}}^ n\). Such problems arise in a variety of applications, such as tolerance design of electronic circuits and obstacle avoidance in the selection of trajectories for robot arms. Such constraints have the form \(\psi\) (x)\(\triangleq \min \{g^ j(x)| j\in J\}\leq 0\). The function \(\psi\) is not continuously differentiable. Algorithms based on the use of generalized gradients have considerable disadvantages because of the local concavity of \(\psi\) at points where the set \(\{j| g^ j(x)=\psi (x)\}\) has more than one element. Algorithms which avoid these disadvantages are presented, and their convergence is established.
0 references
continuously differentiable function
0 references
tolerance design of electronic circuits
0 references
obstacle avoidance
0 references
selection of trajectories for robot arms
0 references
exclusion constraints
0 references
constrained optimization
0 references
locally concave constraints
0 references
0 references