Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 67, 2018 - Issue 2
240
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

DC approach to weakly convex optimization and nonconvex quadratic optimization problems

Pages 195-216 | Received 23 Feb 2015, Accepted 07 Oct 2017, Published online: 25 Oct 2017
 

Abstract

Motivated by weakly convex optimization and quadratic optimization problems, we first show that there is no duality gap between a difference of convex (DC) program over DC constraints and its associated dual problem. We then provide certificates of global optimality for a class of nonconvex optimization problems. As an application, we derive characterizations of robust solutions for uncertain general nonconvex quadratic optimization problems over nonconvex quadratic constraints.

Notes

No potential conflict of interest was reported by the author.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 630.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.