Nonsmooth constraint qualifications for nonconvex inequality systems

DOI10.1080/01630563.2022.2116045MaRDI QIDQ5039375zbMATH OpenOpenAlexFDO

Authors F. Bazargan, H. Mohebi

Publication date 12 October 2022

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630563.2022.2116045

zbMATH Keywords

Karush-Kuhn-Tucker conditionsnonconvex constraintnonsmooth constraint qualificationnonsmooth optimizationoptimality conditiontangential subdifferentialstangentially convex function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• On constraint qualifications of a nonconvex inequality
• A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• General constraint qualifications in nondifferentiable programming
• On constraint qualifications in nonsmooth optimization.

Cites work

• An introduction to the theory of nonsmooth optimization
• Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
• Constraint qualifications in convex vector semi-infinite optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis and nonlinear optimization. Theory and examples.
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• Introduction to nonsmooth optimization. Theory, practice and software
• Karush-Kuhn-Tucker conditions in set optimization
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• New qualification conditions for convex optimization without convex representation
• Nonlinear Programming
• Nonsmooth optimization and its applications. Based on the workshop ``Nonsmooth Optimization and its Applications, Bonn, Germany, May 15--19, 2017
• On representations of the feasible set in convex optimization
• On some methods to derive necessary and sufficient optimality conditions in vector optimization
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Optimality and duality in set-valued optimization utilizing limit sets
• Optimality conditions for convex problems on intersections of non necessarily convex sets
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
• Optimality conditions in convex optimization revisited
• Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative
• Optimization and nonsmooth analysis
• Sufficient conditions for extremum, penalty functions and regularity
• Vector Optimization

Cited in

(1)

• A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification

This page was built for publication: Nonsmooth constraint qualifications for nonconvex inequality systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039375)