Robustness in nonsmooth nonconvex optimization problems
From MaRDI portal
(Redirected from Publication:830202)
Cites work
- scientific article; zbMATH DE number 3484308 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 3336546 (Why is no real title available?)
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
- A biobjective approach to recoverable robustness based on location planning
- An introduction to the theory of nonsmooth optimization
- Characterizing robust solution sets of convex programs under data uncertainty
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Constructing uncertainty sets for robust linear optimization
- Convexificators and strong Kuhn-Tucker conditions
- Duality in robust optimization: Primal worst equals dual best
- Functional analysis, calculus of variations and optimal control
- Integrated production scheduling and delivery routing: complexity results and column generation
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Lectures on Stochastic Programming
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Nonlinear Programming
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Nonsmooth multiobjective programming and constraint qualifications
- On -solutions for convex optimization problems with uncertainty data
- On nonsmooth optimality theorems for robust optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust convex multiobjective optimization
- On robust multiobjective optimization
- On the recoverable robust traveling salesman problem
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Rapid transit network design considering risk aversion
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust convex optimization
- Robust duality for generalized convex programming problems under data uncertainty
- Robust duality in parametric convex optimization
- Robust energy cost optimization of water distribution system with uncertain demand
- Robust optimization
- Robust optimization-methodology and applications
- Robustness concepts for knapsack and network design problems under data uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Strong duality in robust convex programming: complete characterizations
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Theory and applications of robust optimization
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)
