532. Lagrangian duality for generalized convex optimization problems
Invited abstract in session MB-9: Generalized convexity and monotonicity 1, stream Generalized convexity and monotonicity.
Monday, 10:30-12:30Room: B100/8013
Authors (first author is the speaker)
| 1. | Monika Syga
|
| Faculty of Mathematics and Information Science, Warsaw University of Technology | |
| 2. | Ewa Bednarczuk
|
| Modelling and Optimization of Dynamical Systems, Systems Research Institute of the PAS |
Abstract
We investigate Lagrangian duality in the context of nonconvex optimization problems. Utilizing the framework of generalized convexity, we provide criteria that guarantee the zero duality gap property. In our results, we do not need any linear structure in underlying spaces.
Keywords
- Global optimization
- Linear and nonlinear optimization
- Applications of continuous optimization
Status: accepted
Back to the list of papers