Nonsmooth constraint qualifications for nonconvex inequality systems
DOI10.1080/01630563.2022.2116045zbMATH Open1503.90097OpenAlexW4294118785MaRDI QIDQ5039375FDOQ5039375
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
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.
nonsmooth optimizationoptimality conditionnonconvex constraintKarush-Kuhn-Tucker conditionstangential subdifferentialsnonsmooth constraint qualificationtangentially convex function
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Vector Optimization
- Nonlinear Programming
- Title not available (Why is that?)
- Convex analysis and nonlinear optimization. Theory and examples.
- Sufficient conditions for extremum, penalty functions and regularity
- Convex analysis and monotone operator theory in Hilbert spaces
- Constraint qualifications in convex vector semi-infinite optimization
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Introduction to nonsmooth optimization. Theory, practice and software
- 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 the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative
- 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
- New qualification conditions for convex optimization without convex representation
- Nonsmooth optimization and its applications. Based on the workshop ``Nonsmooth Optimization and its Applications, Bonn, Germany, May 15--19, 2017
- Optimality and duality in set-valued optimization utilizing limit sets
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- On some methods to derive necessary and sufficient optimality conditions in vector optimization
- Karush-Kuhn-Tucker conditions in set optimization
- Optimality conditions for convex problems on intersections of non necessarily convex sets
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
Cited In (1)
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)
