A new necessary and sufficient global optimality condition for canonical DC problems
From MaRDI portal
Publication:1945515
DOI10.1007/s10898-012-9908-1zbMath1268.90058OpenAlexW2061195653MaRDI QIDQ1945515
Publication date: 8 April 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9908-1
Related Items (3)
DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ New global optimality conditions for nonsmooth DC optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Outer approximation algorithms for DC programs and beyond
- A level set algorithm for a class of reverse convex programs
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- Convex programs with an additional reverse convex constraint
- Convex programs with several additional reverse convex constraints
- A method for solving reverse convex programming problems
- Some further duality theorems for optimization problems with reverse convex constraint sets
- Duality in nonconvex optimization
- A duality principle for non-convex optimisation and the calculus of variations
- Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
- Comments on a reverse convex programming algorithm
- A convex envelope formula for multilinear functions
- Necessary and sufficient global optimality conditions for convex maximization revisited
- On global optimality conditions and cutting plane algorithms
- Letter to the editor: Remarks on an algorithm for reverse convex programs
- Canonical DC programming problem: Outer approximation methods revisited
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Outer approximation algorithms for canonical DC problems
- Approximate optimality conditions and stopping criteria in canonical DC programming
- When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?
- Global minimization of a difference of two convex functions
- A modified version of Tuy's method for solving d.c. programing problem
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- A Fenchel-Rockafellar type duality theorem for maximization
- Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Introduction to global optimization.
This page was built for publication: A new necessary and sufficient global optimality condition for canonical DC problems
