Deterministic characterizations of approximate solutions for nonsmooth nonconvex uncertain programs

DOI10.1051/RO/2026081MaRDI QIDQ7348891zbMATH OpenFDO

Authors Arshpreet Kaur, I. Ahmad

Publication date 15 September 2026

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2026081

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
• Characterizations for optimality conditions of general robust optimization problems
• Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
• Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
• Convexity and closedness in stable robust duality
• Duality in robust optimization: Primal worst equals dual best
• scientific article; zbMATH DE number 3662118 (Why is no real title available?)
• Minmax robustness for multi-objective optimization problems
• Necessary conditions for ε-optimality
• On \(\epsilon\)-solutions for robust semi-infinite optimization problems
• On approximate solutions for nonsmooth robust multiobjective optimization problems
• On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
• On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• Optimization and nonsmooth analysis
• Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
• Robust duality for generalized convex nonsmooth vector programs with uncertain data in constraints
• Robust multiobjective optimization with application to Internet routing
• Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
• Some characterizations of approximate solutions for robust semi-infinite optimization problems
• Theory and applications of robust optimization
• Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization

This page was built for publication: Deterministic characterizations of approximate solutions for nonsmooth nonconvex uncertain programs

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