On intrinsic complexity of bilevel optimization
Abstract: We examine bilevel optimization from the parametric perspective. Observing the intrinsic complexity of bilevel optimization, we emphasize that it originates from unavoidable degeneracies occurring in parametric optimization. Under intrinsic complexity we understand the involved geometrical complexity of bilevel feasible sets, such as the appearance of kinks and boundary points, non-closedness, discontinuity and bifurcation eects. By taking the study of singularities in parametric optimization into account, the structural analysis of bilevel feasible sets is performed. We describe...
Read MoreOptimal control of the sweeping process over polyhedral controlled sets
The talk concerns a new class of optimal control problems governed by the dissipative non-Lipschitzian differential inclusion of the sweeping/Moreau process over a moving controlled polyhedral set. Using the method of discrete approximations and generalized differential tools of variational analysis, we derive necessary optimality conditions for this problem expressed in terms of the initial data of the moving convex polyhedron.
Read MoreCoupling geophysical fluid models with biological processes in coastal engineering biorermediation and confinement of lagoons
Este seminario se realiza en conjunto con Manejo de Recursos Naturales
Read More



Noticias en español
