| |
|
- Optimization
- Global Optimization
- Warmstarting local optimizors
- MILP approach to solve MINLP problems
- Power Systems
- Local Solutions of Optimal power flow
- MILP approach to power systems islanding
- Heuristics for power system islanding
- Antenna Array Optimization
The problem of finding optimal weights of given antenna array is LP and is relatively easy to solve. If we decide to optimize antenna elements position then this LP becomes NLP and is hard to solve. This problem becomes MINLP when we consider 'array thinning' along with optimizing weights and positions of antenna elements.
Convexity is such a useful attribute in optimization. I am interested in finding more general classes of convex sets and convex functions. Such general classes ideally should posses some of the features of convex sets and convex functions so that we can use results from convex analysis on generalized classes. Some generalized classes such as quasi convexity, G-convexity, (EF)-convexity is introduced in literature. I am member of WGGC which is a good source to find latest developments in this area.
|
|