EconPapers    
Economics at your fingertips  
 

Constraint qualifications for convex optimization without convexity of constraints: New connections and applications to best approximation

N.H. Chieu, V. Jeyakumar, G. Li and H. Mohebi

European Journal of Operational Research, 2018, vol. 265, issue 1, 19-25

Abstract: We study constraint qualifications and necessary and sufficient optimality conditions for a convex optimization problem with inequality constraints where the constraint functions are continuously differentiable but they are not assumed to be convex. We present constraint qualifications under which the Karush–Kuhn–Tucker conditions are necessary and sufficient for optimality without the convexity of the constraint functions and establish new links among various known constraint qualifications that guarantee necessary Karush–Kuhn–Tucker conditions. We also present a new constraint qualification which is the weakest constraint qualification for the Karush–Kuhn–Tucker conditions to be necessary for optimality of the convex optimization problem. Consequently, we present Lagrange multiplier characterizations for the best approximation from a convex set in the face of nonconvex inequality constraints, extending corresponding known results in the literature. We finally give a table summarizing various links among the constraint qualifications.

Keywords: Convex programming; Nonconvex constraints; Constraint qualifications; Best approximation; Necessary and sufficient optimality conditions (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717306653
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:265:y:2018:i:1:p:19-25

DOI: 10.1016/j.ejor.2017.07.038

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:ejores:v:265:y:2018:i:1:p:19-25