Searched for: subject%3A%22convex%255C+programming%22
(1 - 8 of 8)
document
Diercks, Ties (author)
Optimising spacecraft reorientation manoeuvres with respect to time, energy and propellant is essential for achieving a high mission performance. Solving this reorientation problem in real time and onboard is considered to be a promising opportunity to achieve further efficiency improvements in space missions. However, the nonlinear programming ...
master thesis 2021
document
Mohammadi, Majid (author), Mousavi, S. Hamid (author), Effati, Sohrab (author)
With the advancement in information technology, datasets with an enormous amount of data are available. The classification task on these datasets is more time- and memory-consuming as the number of data increases. The support vector machine (SVM), which is arguably the most popular classification technique, has disappointing performance in...
journal article 2021
document
Rostampour, Vahab (author), Keviczky, T. (author)
This paper presents a distributed computational framework for stochastic convex optimization problems using the so-called scenario approach. Such a problem arises, for example, in a large-scale network of interconnected linear systems with local and common uncertainties. Due to the large number of required scenarios to approximate the...
review 2021
document
Noom, Jacques (author)
Currently used imaging methods in Atomic Force Microscopy (AFM) including the use of a Lock-In Amplifier or a Phase-Locked Loop, are suboptimal. In this report, the image resolution in AFM is improved by detecting the tip-sample interaction using complete measurements of the input of the cantilever and its measured deflection. Two methods are...
master thesis 2019
document
Alonso-Mora, J. (author), Baker, Stuart (author), Rus, Daniela (author)
We present a constrained optimization method for multi-robot formation control in dynamic environments, where the robots adjust the parameters of the formation, such as size and three-dimensional orientation, to avoid collisions with static and moving obstacles, and to make progress towards their goal. We describe two variants of the...
journal article 2017
document
de Ridder, K.M. (author)
Convex guidance is a developing guidance algorithm that seeks to unify the trajectory optimisation for pin-point landings. The unification would mean the elimination of the need of different optimisation techniques for different stages of the landing. Using convex optimisation, convex guidance is guaranteed to find the global-optimum of the design...
master thesis 2016
document
Deklerck, M. (author)
Structural optimization, first introduced by Schmidt in 1960, is a rapid growing factor in the development of new aerospace structures. This growth is established by the increase in numerical modelling techniques, cheaper computer power, the increasing cost of production and competition between companies. The combination of both structural...
master thesis 2016
document
Doelman, R. (author), Verhaegen, M.H.G. (author)
We consider the use of the nuclear norm operator, and its tendency to produce low rank results, to provide a convex relaxation of Bilinear Matrix Inequalities (BMIs). The BMI is first written as a Linear Matrix Inequality (LMI) subject to a bi-affine equality constraint and subsequently rewritten into an LMI subject to a rank constraint on a...
conference paper 2016
Searched for: subject%3A%22convex%255C+programming%22
(1 - 8 of 8)