New global optimality conditions for nonsmooth DC optimization problems
From MaRDI portal
Publication:2301178
DOI10.1007/S10898-019-00833-7zbMATH Open1436.90110arXiv1808.03590OpenAlexW2978304898WikidataQ127172738 ScholiaQ127172738MaRDI QIDQ2301178FDOQ2301178
Authors: Maxim Dolgopolik 
Publication date: 28 February 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1808.03590
Recommendations
- A new necessary and sufficient global optimality condition for canonical DC problems
- Local and global optimality conditions for dc infinite optimization problems
- Global optimality conditions and exact penalization
- scientific article; zbMATH DE number 4112402
- scientific article; zbMATH DE number 2084880
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- DC programming: overview.
- Title not available (Why is that?)
- Convex Analysis
- The Euler and Weierstrass conditions for nonsmooth variational problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A first course in Sobolev spaces
- Set-valued analysis
- Global optimality conditions for nonconvex optimization
- Conditions for global optimality. II
- Necessary and sufficient global optimality conditions for convex maximization revisited
- On local search in d.c. optimization problems
- Title not available (Why is that?)
- On global search in nonconvex optimal control problems
- Metric regularity, tangent sets, and second-order optimality conditions
- Abstract convexity and global optimization
- A closedness condition and its applications to DC programs with convex constraints
- Error bounds and metric subregularity
- A unified theory for metric regularity of multifunctions
- Convex analysis and global optimization
- Introduction to global optimization.
- Title not available (Why is that?)
- First order and second order characterizations of metric subregularity and calmness of constraint set mappings
- Exact penalty and error bounds in DC programming
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Title not available (Why is that?)
- Piecewise affine functions and polyhedral sets∗
- On global unconstrained minimization of the difference of polyhedral functions
- Conditions for an extremum in metric spaces
- Global minimization of a difference of two convex functions
- Title not available (Why is that?)
- On covering method for d.c. optimization.
- A method of truncated codifferential with application to some problems of cluster analysis
- Codifferential method for minimizing nonsmooth DC functions
- Duality for nonconvex approximation and optimization.
- Convex programs with an additional reverse convex constraint
- A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness
- Outer approximation algorithms for canonical DC problems
- A unifying theory of exactness of linear penalty functions
- Approximate optimality conditions and stopping criteria in canonical DC programming
- Title not available (Why is that?)
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Title not available (Why is that?)
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions
- On global optimality conditions and cutting plane algorithms
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- Abstract convex approximations of nonsmooth functions
- Title not available (Why is that?)
- DC programming and DCA: thirty years of developments
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Canonical DC programming problem: Outer approximation methods revisited
- Global optimality conditions in nonconvex optimization
- A new necessary and sufficient global optimality condition for canonical DC problems
- A convergence analysis of the method of codifferential descent
- Aggregate codifferential method for nonsmooth DC optimization
- Nonsmooth problems of calculus of variations via codifferentiation
- Title not available (Why is that?)
- Global optimality conditions and exact penalization
- Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time
- On a local search for reverse convex problems
- The method of codifferential descent for convex and global piecewise affine optimization
Cited In (2)
This page was built for publication: New global optimality conditions for nonsmooth DC optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301178)
