Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
From MaRDI portal
Publication:6064032
DOI10.1007/s10898-022-01134-2OpenAlexW4212940883MaRDI QIDQ6064032
Xiang-Kai Sun, Unnamed Author, Xian-Jun Long
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01134-2
tangential subdifferentialrobust optimal solution setDini pseudoconvexitynonconvex uncertain semi-infinite programming
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (3)
Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Robust duality in parametric convex optimization
- Robustness in nonsmooth nonconvex optimization problems
- Duality in robust optimization: Primal worst equals dual best
- On characterizing the solution sets of pseudoinvex extremum problems
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterizations of robust solution set of convex programs with uncertain data
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Robust optimization-methodology and applications
- On characterizing the solution sets of pseudolinear programs
- Characterizations of the solution set for a class of nonsmooth optimization problems
- On approximate efficiency for nonsmooth robust vector optimization problems
- Characterizing the solution set of convex optimization problems without convexity of constraints
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Characterizing robust solution sets of convex programs under data uncertainty
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Characterization of solution sets of convex programs
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Optimization and nonsmooth analysis
- On constraint qualifications in directionally differentiable multiobjective optimization problems
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
- Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Convex Analysis
This page was built for publication: Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
