Thu.3 13:30–14:45 | H 0106 | NON
.

Nonlinear Optimization – Contributed Session 3/3

Chair: Refail Kasimbeyli
13:30

Gulcin Dinc Yalcin

joint work with Refail Kasimbeyli

Weak Subgradient Based Cutting Plane Method

In this study, we present a version of the Cutting-Plane Method, developed for minimizing a nonconvex function. We use weak subgradients which is based on the idea of supporting conic surfaces. This supporting approach does not require convexity condition on the function. The suggested method, minimizes the pointwise maximum of superlinear functions, by the weak subgradient. Since the graphs of supporting functions are conical surfaces, the new method is called the "Cutting Conic Surfaces Method". The subproblem is “linearized” and some illustrative examples are provided. Acknowledgment : This study is supported by The Scientific and Technological Research Council of Turkey (TUBITAK) under the Grant No. 217M487.

13:55

Rafael Durbano Lobato

joint work with Antonio Frangioni

SMS++: a Structured Modelling System for (Among Others) Multi-Level Stochastic Problems

The aim of the open-source Structured Modeling System++ (SMS++) is to facilitate the implementation of general and flexible algorithms for optimization problems with several nested layers of structure. We will present the current state of SMS++, focussing on recent developments concerning the representation of uncertainty, which are meant to facilitate the transformation of complex deterministic models into stochastic ones. Specific SMS++ facilities for "general-purpose decomposition techniques" will then allow to efficiently produce multi-level decomposition approaches to these problems.

14:20

Refail Kasimbeyli

joint work with Gulcin Dinc Yalcin

Weak subgradient based solution method using radial epiderivatives

This work presents a weak subgradient based solution method in nonconvex unconstrained optimization. The weak subgradient notion does not require convexity condition on the function under consideration, and hence allows to investigate a wide class of nonconvex optimization problems. By using relationships between the weak subgradients and the radial epiderivatives, we present a method for approximate estimation of weak subgradients, and use it to update a current solution. The convergence theorems for the presented method, are established and the illustrative examples are provided. Acknowledgment : This study is supported by The Scientific and Technological Research Council of Turkey (TUBITAK) under the Grant No. 217M487.