On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential

DOI10.1007/s11590-023-02078-6OpenAlexW4389567824MaRDI QIDQ6204200

Nooshin Movahedian, Mansoureh Alavi Hejazi

Publication date: 27 March 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-023-02078-6

zbMATH Keywords

nonsmooth analysis constraint qualification necessary optimality condition pseudo-differential pseudo-Jacobian robust optimization problems

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

Unnamed Item
Unnamed Item
On the recoverable robust traveling salesman problem
Robust duality for generalized convex programming problems under data uncertainty
A new Abadie-type constraint qualification for general optimization problems
Robustness in nonsmooth nonconvex optimization problems
Duality in robust optimization: Primal worst equals dual best
A generalized derivative for calm and stable functions
Convex analysis and nonlinear optimization. Theory and examples
On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians
On Abadie constraint qualification for multiobjective optimization problems
On quasi \(\epsilon\)-solution for robust convex optimization problems
A biobjective approach to recoverable robustness based on location planning
Characterizing robust solution sets of convex programs under data uncertainty
Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
Techniques of variational analysis
Robust Convex Optimization
Strong Duality in Robust Convex Programming: Complete Characterizations
Optimization and nonsmooth analysis
Convexifactors, generalized convexity and vector optimization
The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
Convex Analysis
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Optimality and duality for robust multiobjective optimization problems

This page was built for publication: On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential