Robustness in nonsmooth nonconvex optimization problems

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Robustness in mathematical programming (90C17)

Cites Work

Theory and Applications of Robust Optimization
Functional Analysis, Calculus of Variations and Optimal Control
Title not available (Why is that?)
Title not available (Why is that?)
Duality in robust optimization: Primal worst equals dual best
On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
Strong Duality in Robust Convex Programming: Complete Characterizations
Constructing Uncertainty Sets for Robust Linear Optimization
Lectures on Stochastic Programming
Nonlinear Programming
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Robust optimization-methodology and applications
Robust convex optimization
Title not available (Why is that?)
Convexificators and strong Kuhn-Tucker conditions
Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
On robust multiobjective optimization
Title not available (Why is that?)
Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation
Rapid transit network design considering risk aversion
Robust duality for generalized convex programming problems under data uncertainty
Constrained qualifications in multiobjective optimization problems: Differentiable case
Characterizing robust solution sets of convex programs under data uncertainty
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
ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
Title not available (Why is that?)
Robust conjugate duality for convex optimization under uncertainty with application to data classification
Subdifferential Formulae for the Supremum of an Arbitrary Family of Functions
Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
An introduction to the theory of nonsmooth optimization
Optimality and duality for robust multiobjective optimization problems
Optimality Conditions for Nonconvex Constrained Optimization Problems
On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
A biobjective approach to recoverable robustness based on location planning
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
Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty
Nonsmooth multiobjective programming and constraint qualifications
Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
Title not available (Why is that?)

Cited In (9)

Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
Robust Norm Equivalencies and Preconditioning
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
Applying tangential subdifferentials in bilevel optimization
Robustness of Accelerated First-Order Algorithms for Strongly Convex Optimization Problems
On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
On multiobjective bilevel optimization using tangential subdifferentials
On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization

This page was built for publication: Robustness in nonsmooth nonconvex optimization problems

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