Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
From MaRDI portal
Publication:6038921
DOI10.1186/s13660-022-02866-1zbMath1509.90196OpenAlexW4302007904MaRDI QIDQ6038921
No author found.
Publication date: 3 May 2023
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-022-02866-1
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Optimality and duality results for bilevel programming problem using convexifactors
- Duality for nonsmooth semi-infinite programming problems
- Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints
- Invexity and optimization
- Wolfe duality for interval-valued optimization
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
- On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
- Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications
- On approximate solutions and saddle point theorems for robust convex optimization
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Duality in Vector Optimization
- A duality theorem for non-linear programming
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- MPEC Methods for Bilevel Optimization Problems
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
- Proximal Methods in Vector Optimization
- Pseudo-Convex Functions
- Duality theorems for convex functions
- Duality for nonsmooth mathematical programming problems with equilibrium constraints
This page was built for publication: Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
