Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems
From MaRDI portal
Publication:5039375
DOI10.1080/01630563.2022.2116045zbMath1503.90097OpenAlexW4294118785MaRDI QIDQ5039375
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
nonsmooth optimizationoptimality conditionKarush-Kuhn-Tucker conditionsnonconvex constrainttangential subdifferentialsnonsmooth constraint qualificationtangentially convex function
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Constraint qualifications in convex vector semi-infinite optimization
- Convex analysis and nonlinear optimization. Theory and examples.
- New qualification conditions for convex optimization without convex representation
- On representations of the feasible set in convex optimization
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- On some methods to derive necessary and sufficient optimality conditions in vector optimization
- Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative
- 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
- Optimality conditions in convex optimization revisited
- 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
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Karush-Kuhn-Tucker conditions in set optimization
- Introduction to Nonsmooth Optimization
- Vector Optimization
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimization and nonsmooth analysis
- An introduction to the theory of nonsmooth optimization
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
- Nonlinear Programming
- Convex analysis and monotone operator theory in Hilbert spaces
- Sufficient conditions for extremum, penalty functions and regularity
