PT EN

Optimization

Program

Optimality conditions and duality theory for conic, convex, non-linear, non-differentiable and multi-objective optimization. Depending on the approach to the course, other topics might be considered, such as numerical methods for continuous optimization, algebraic methods and representability in polynomial optimization and semi-definite programming, or continuous relaxations for combinatorial problems.

Research and Events

Events

  • Truncated boolean representable simplicial complexes
    Pedro V. Silva (UP)
    14:30, Room 2.5, UC Math. Dept.
    (Seminar)
    December 12, 2018
  • Superalgebras with superinvolution
    Herlisvaldo Costa Santos (student)
    14:00, Room 2.5, UC Math. Dept.
    (Seminar)
    December 12, 2018
More Events

Defended Theses

More Theses