Constraint qualifications for nonsmooth programming

DOI10.1080/02331934.2018.1546702MaRDI QIDQ4646547zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1263981
• General constraint qualifications in nondifferentiable programming
• Nonsmooth multiobjective programming and constraint qualifications
• A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
• Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints

Cites work

• scientific article; zbMATH DE number 3291743 (Why is no real title available?)
• Convex analysis and nonlinear optimization. Theory and examples
• Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
• Nonlinear programming
• On First- and Second-Order Conditions for Error Bounds
• Optimization and nonsmooth analysis
• Tangent cone and contingent cone to the intersection of two closed sets
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Variational Analysis

Cited in

(11)

• Asymptotic stationarity and regularity for nonsmooth optimization problems
• General constraint qualifications in nondifferentiable programming
• On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems
• Qualification Conditions in Semialgebraic Programming
• 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
• scientific article; zbMATH DE number 7270290 (Why is no real title available?)
• Programming with a non-differentiable constraint.
• Infinite alternative theorems and nonsmooth constraint qualification conditions
• Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’
• A practical optimality condition without constraint qualifications for nonlinear programming

This page was built for publication: Constraint qualifications for nonsmooth programming

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