Refined optimality conditions for differences of convex functions
From MaRDI portal
Publication:708908
DOI10.1007/S10898-009-9495-YzbMATH Open1225.90102OpenAlexW2078792421WikidataQ110086240 ScholiaQ110086240MaRDI QIDQ708908FDOQ708908
Publication date: 15 October 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9495-y
Recommendations
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- State Constraints in Convex Control Problems of Bolza
- Quantitative Stability of Variational Systems II. A Framework for Nonlinear Conditioning
- Title not available (Why is that?)
- A parametric characterization of local optimality
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- Clustering and the perturbed spatial median
- On the minimization of difference functions
- A formula on the approximate subdifferential of the difference of convex functions
Cited In (5)
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Title not available (Why is that?)
- Focus on sufficient optimality conditions in D.C. vector optimization
- Conditions characterizing minima of the difference of functions
- Stability of saddle points via explicit coderivatives of pointwise subdifferentials
This page was built for publication: Refined optimality conditions for differences of convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708908)