Optimality Conditions for Nonconvex Constrained Optimization Problems
DOI10.1080/01630563.2019.1640249zbMATH Open1472.90100OpenAlexW2959269878WikidataQ127498086 ScholiaQ127498086MaRDI QIDQ5238081FDOQ5238081
Feryal Mashkoorzadeh, S. Nobakhtian, N. Movahedian
Publication date: 28 October 2019
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2019.1640249
nonconvex optimizationnonsmooth optimizationoptimality conditionconstraint qualificationlocally convexlocally Lipschitziantangential subdifferentialeffective domainextended realstangentially convexquasi differentiable
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functional Analysis, Calculus of Variations and Optimal Control
- Nonlinear Programming
- Convexity and optimization in \({\mathbb R^n}\)
- Sufficient conditions for extremum, penalty functions and regularity
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- Optimality conditions in convex optimization revisited
- On representations of the feasible set in convex optimization
- An introduction to the theory of nonsmooth optimization
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Necessary and sufficient KKT optimality conditions in non-convex optimization
Cited In (23)
- Normality of the maximum principle for nonconvex constrained Bolza problems
- Title not available (Why is that?)
- Robustness in nonsmooth nonconvex optimization problems
- Optimality conditions in extremal problems with nonregular inequality constraints
- Title not available (Why is that?)
- Optimality criteria in nonlinear programming involving nonconvex functions
- Remarks on a benchmark nonlinear constrained optimization problem
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Characterizations of the solution set for tangentially convex optimization problems
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- Necessary optimality conditions for nonconvex differential inclusions with endpoint constraints
- On optimality conditions in nonsmooth inequality constrained minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Title not available (Why is that?)
- Optimality conditions in non-convex set-valued optimization
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- A mean value theorem for tangentially convex functions
- Nonsmooth Optimum Problems with Constraints
- An optimality condition for a nondifferentiable convex program
- Optimality Conditions for Nonconvex Variational Problems with Integral Constraints in Banach Spaces
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Characterizing the solution set of convex optimization problems without convexity of constraints π π
- General constraint qualifications in nondifferentiable programming π π
- Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials π π
- The DTC (difference of tangentially convex functions) programming: optimality conditions π π
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials π π
- Dini Derivatives of the Marginal Function of a Non-Lipschitzian Program π π
- Characterizations of the solution set for tangentially convex optimization problems π π
This page was built for publication: Optimality Conditions for Nonconvex Constrained Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238081)