Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
From MaRDI portal
Publication:1615937
DOI10.1007/s10479-016-2337-7zbMath1401.90203OpenAlexW2526387334MaRDI QIDQ1615937
Publication date: 31 October 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2337-7
multiobjective optimizationnormal regularitylimiting subdifferentialsemi-infinite programuniformly sequentially regular function
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (11)
Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints ⋮ Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ On global well-posedness of semi-infinite set optimization problems ⋮ Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty ⋮ Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Directionally generalized differentiation for multifunctions and applications to set-valued programming problems ⋮ Minimax programming as a tool for studying robust multi-objective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Subdifferential of optimal value functions in nonlinear infinite programming
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Generalized Clarke epiderivatives of parametric vector optimization problems
- Subsmooth semi-infinite and infinite optimization problems
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Subgradients of marginal functions in parametric mathematical programming
- Normal cones to infinite intersections
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Derivatives of the efficient point multifunction in parametric vector optimization problems
- Nonsmooth semi-infinite multiobjective optimization problems
- Nondifferentiable minimax programming problems with applications
- Hölder-Like Property and Metric Regularity of a Positive-Order for Implicit Multifunctions
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Subdifferentials of Marginal Functions in Semi-infinite Programming
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Optimization and nonsmooth analysis
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
