Robustness in nonsmooth nonconvex optimization problems
From MaRDI portal
Publication:830202
DOI10.1007/s11117-020-00783-5OpenAlexW3048180419MaRDI QIDQ830202
F. Mashkoorzadeh, Nooshin Movahedian, Soghra Nobakhtian
Publication date: 7 May 2021
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-020-00783-5
nonsmooth optimizationrobustnessnonconvex optimizationoptimality conditiontangential subdifferential
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Robustness in mathematical programming (90C17)
Related Items
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials, Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data, On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential, On multiobjective bilevel optimization using tangential subdifferentials, On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Rapid transit network design considering risk aversion
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- On the recoverable robust traveling salesman problem
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Robust duality in parametric convex optimization
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for generalized convex programming problems under data uncertainty
- Convexificators and strong Kuhn-Tucker conditions
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Duality in robust optimization: Primal worst equals dual best
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- A biobjective approach to recoverable robustness based on location planning
- Robust optimization-methodology and applications
- Characterizing robust solution sets of convex programs under data uncertainty
- Robust energy cost optimization of water distribution system with uncertain demand
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- On robust multiobjective optimization
- Robust Convex Optimization
- Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty
- Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation
- Nonsmooth multiobjective programming and constraint qualifications
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constructing Uncertainty Sets for Robust Linear Optimization
- Theory and Applications of Robust Optimization
- Functional Analysis, Calculus of Variations and Optimal Control
- Lectures on Stochastic Programming
- An introduction to the theory of nonsmooth optimization
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
- Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Nonlinear Programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Optimality and duality for robust multiobjective optimization problems
