On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians

DOI10.1007/s10957-018-1336-zzbMath1402.90205OpenAlexW2884096843WikidataQ129460513 ScholiaQ129460513MaRDI QIDQ1626525

Y. Aharonov

Publication date: 27 November 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-1336-z

zbMATH Keywords

nonsmooth analysissensitivity analysisconstraint qualificationnecessary optimality conditionpseudo-Jacobian

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)

Related Items (max. 100)

Multiobjective optimization with least constraint violation: optimality conditions and exact penalization ⋮ On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential ⋮ A new Abadie-type constraint qualification for general optimization problems

Uses Software

• GradSamp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient method for nonconvex nonsmooth optimization
• On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems
• Introduction to sensitivity and stability analysis in nonlinear programming
• Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints
• Subgradients of marginal functions in parametric mathematical programming
• On regularity for constrained extremum problems. I: Sufficient optimality conditions
• On regularity for constrained extremum problems. II: Necessary optimality conditions
• A generalized derivative for calm and stable functions
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Methods of descent for nondifferentiable optimization
• Nonsmooth vector functions and continuous optimization
• Functional Analysis, Calculus of Variations and Optimal Control
• Marginal values and second-order necessary conditions for optimality
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• Differential properties of the marginal function in mathematical programming
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• Solution Stability of Nonsmooth Continuous Systems with Applications to Cone-Constrained Optimization
• Convexifactors, generalized convexity and vector optimization
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
• Variational Analysis of Regular Mappings
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization

This page was built for publication: On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians