New global optimality conditions for nonsmooth DC optimization problems
arXiv:1808.03590 · doi:10.1007/s10898-019-00833-7
Abstract
In this article we propose a new approach to an analysis of DC optimization problems. This approach was largely inspired by codifferential calculus and the method of codifferential descent and is based on the use of a so-called affine support set of a convex function instead of the Frenchel conjugate function. With the use of affine support sets we define a global codifferential mapping of a DC function and derive new necessary and sufficient global optimality conditions for DC optimization problems. We also provide new simple necessary and sufficient conditions for the global exactness of the penalty function for DC optimization problems with equality and inequality constraints and present a series of simple examples demonstrating a constructive nature of the new global optimality conditions. These examples show that when the optimality conditions are not satisfied, they can be easily utilised in order to find "global descent" directions of both constrained and unconstrained problems. As an interesting theoretical example, we apply our approach to the analysis of a nonsmooth problem of Bolza.
References in corpus (8)
- Error Bounds and Metric Subregularity
- A Unifying Theory of Exactness of Linear Penalty Functions
- Abstract convex approximations of nonsmooth functions
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions
- A convergence analysis of the method of codifferential descent
- A Unified Approach to the Global Exactness of Penalty and Augmented Lagrangian Functions I: Parametric Exactness
- The method of codifferential descent for convex and global piecewise affine optimization
- Computation of the Epsilon-Subdifferential of Convex Piecewise-Defined Functions in Optimal Worst-Case Time