scholarly journals Determinant Maximization with Linear Matrix Inequality Constraints

1998 ◽  
Vol 19 (2) ◽  
pp. 499-533 ◽  
Author(s):  
Lieven Vandenberghe ◽  
Stephen Boyd ◽  
Shao-Po Wu
2020 ◽  
Vol 26 (23-24) ◽  
pp. 2297-2315
Author(s):  
Valiollah Ghaffari

The proportional-derivative sliding-mode control will be designed and tuned in the trajectory tracking of a robot manipulator which operates on uncertain dynamic environments. For achieving these goals, first, a linear matrix inequality–based framework is suggested to design a robust proportional-derivative sliding-mode control in the presence of external disturbances. Next, the parameters of the proportional-derivative sliding-mode control law will be tuned via another minimization problem subjected to some linear matrix inequality constraints. Thus, the controller parameters can be automatically updated via the solution of the optimization problem. The results are successfully used in the robot manipulator with considering two reference paths and some different loads. The simulation results show the effectiveness of the proposed method in comparison with the same technique.


2006 ◽  
Vol 47 (4) ◽  
pp. 439-450 ◽  
Author(s):  
N. Q. Huy ◽  
V. Jeyakumar ◽  
G. M. Lee

AbstractIn this paper, we present sufficient conditions for global optimality of a general nonconvex smooth minimisation model problem involving linear matrix inequality constraints with bounds on the variables. The linear matrix inequality constraints are also known as “semidefinite” constraints which arise in many applications, especially in control system analysis and design. Due to the presence of nonconvex objective functions such minimisation problems generally have many local minimisers which are not global minimisers. We develop conditions for identifying global minimisers of the model problem by first constructing a (weighted sum of squares) quadratic underestimator for the twice continuously differentiable objective function of the minimisation problem and then by characterising global minimisers of the easily tractable underestimator over the same feasible region of the original problem. We apply the results to obtain global optimality conditions for optinusation problems with discrete constraints.


Author(s):  
Pablo Speciale ◽  
Danda Pani Paudel ◽  
Martin R. Oswald ◽  
Till Kroeger ◽  
Luc Van Gool ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document