Nonsmooth interval-valued optimization and saddle-point optimality criteria
From MaRDI portal
Publication:503515
DOI10.1007/s40840-015-0237-7zbMath1385.90020OpenAlexW2236509707MaRDI QIDQ503515
Anurag Jayswal, Jonaki Banerjee, Izhar Ahmad
Publication date: 13 January 2017
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0237-7
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (15)
An exact \(l_1\) penalty approach for interval-valued programming problem ⋮ Optimality conditions and duality results for non-differentiable interval optimization problems ⋮ On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities ⋮ A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization ⋮ Higher-order duality relations for multiobjective fractional problems involving support functions ⋮ Optimality conditions for fuzzy optimization problems under granular convexity concept ⋮ Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ On nondifferentiable semi-infinite multiobjective programming with interval-valued functions ⋮ Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems ⋮ Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems ⋮ On optimality conditions and duality for non-differentiable interval-valued programming problems with the generalized \((F, \rho)\)-convexity ⋮ Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions ⋮ On semidifferentiable interval-valued programming problems ⋮ Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
Cites Work
- On sufficiency and duality for a class of interval-valued programming problems
- Optimality conditions and duality in nonsmooth multiobjective programs
- Duality theory for optimization problems with interval-valued objective functions
- Wolfe duality for interval-valued optimization
- On sufficiency of the Kuhn-Tucker conditions
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Efficient solution of interval optimization problem
- On a nonsmooth vector optimization problem with generalized cone invexity
- Optimality conditions and duality in nondifferentiable interval-valued programming
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function
- Duality and saddle-point type optimality for interval-valued programming
- Optimality Conditions in Vector Optimization
- Optimality Condition and Mixed Duality for Interval-Valued Optimization
- Optimization and nonsmooth analysis
- Nondifferentiable optimization by smooth approximations
- An Interactive Method To Multiobjective Linear Programming Problems With Interval Coefficients
- Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control
This page was built for publication: Nonsmooth interval-valued optimization and saddle-point optimality criteria
