Optimality Conditions for Nonconvex Constrained Optimization Problems
Authors:
- 15 July 2019
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 40 (16) , 1918-1938
Abstract
We present optimality conditions for a class of nonsmooth and nonconvex constrained optimization problems. To achieve this aim, various well-known constraint qualifications are extended based on the concept of tangential subdifferential and the relations between them are investigated. Moreover, local and global necessary and sufficient optimality conditions are derived in the absence of convexity of the feasible set. In addition to the theoretical results, several examples are provided to illustrate the advantage of our outcomes.Keywords
Funding Information
- IPM (98900417)
This publication has 14 references indexed in Scilit:
- Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximationEuropean Journal of Operational Research, 2018
- Optimality Conditions of Approximate Solutions for Nonsmooth Semi-infinite Programming ProblemsJournal of the Operations Research Society of China, 2017
- Necessary and sufficient KKT optimality conditions in non-convex optimizationOptimization Letters, 2016
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraintsOptimization Letters, 2014
- Optimality conditions in convex optimization revisitedOptimization Letters, 2011
- On representations of the feasible set in convex optimizationOptimization Letters, 2009
- Convex Optimization2004
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex InequalitiesSIAM Journal on Optimization, 1997
- Constraint qualifications in multiobjective optimization problems: Differentiable caseJournal of Optimization Theory and Applications, 1994
- An Introduction to the Theory of Nonsmooth OptimizationOptimization, 1986