Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints

DOI10.1080/02331934.2022.2045987zbMath1522.90213OpenAlexW4221014405MaRDI QIDQ6169208

C. S. Lalitha, Rimpi

Publication date: 14 August 2023

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth analysisoptimality conditionsconstraint qualificationsconvexificators

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
• Convexificators and strong Kuhn-Tucker conditions
• Convexifactors, generalized convexity, and optimality conditions
• On constraint qualifications in nonsmooth optimization.
• A relaxed constant positive linear dependence constraint qualification and applications
• Optimality conditions for multiobjective fractional programming, via convexificators
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• General constraint qualifications in nondifferentiable programming
• A generalized derivative for calm and stable functions
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Error bounds in mathematical programming
• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
• On the variational principle
• Pseudonormality and a Lagrange multiplier theory for constrained optimization
• Equivalent conditions for local error bounds
• Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization
• Nonsmooth vector functions and continuous optimization
• Sufficient Conditions for Error Bounds
• On relaxed constant rank regularity condition in mathematical programming
• Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
• Directional derivative of the marginal function in nonlinear programming
• Optimization and nonsmooth analysis
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Convexificators and boundedness of the Kuhn–Tucker multipliers set
• Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators
• Constraint qualifications for nonsmooth programming
• A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
• Two New Weak Constraint Qualifications and Applications
• Improved enhanced Fritz John condition and constraints qualifications using convexificators
• Theory of Positive Linear Dependence

This page was built for publication: Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints