Constraint qualifications for nonsmooth programming

DOI10.1080/02331934.2018.1546702zbMath1465.90119OpenAlexW2901578576MaRDI QIDQ4646547

Liren Huang, Chunguang Liu, Lu-Lin Tan

Publication date: 14 January 2019

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

error boundconstraint qualificationHadamard's derivativesmooth and nonsmooth mathematical programming

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Related Items

Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints, Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications

Cites Work

• Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
• Tangent cone and contingent cone to the intersection of two closed sets
• Convex analysis and nonlinear optimization. Theory and examples
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Optimization and nonsmooth analysis
• Variational Analysis
• On First- and Second-Order Conditions for Error Bounds
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
• Unnamed Item
• Unnamed Item