Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators

From MaRDI portal
Publication:346833

DOI10.1007/s10957-016-0885-2zbMath1349.90837OpenAlexW2252823212MaRDI QIDQ346833

Yogendra Pandey, Shashi Kant Mishra

Publication date: 30 November 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-0885-2




Related Items (15)

Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraintsRobust strong duality for nonconvex optimization problem under data uncertainty in constraintOn semi-infinite mathematical programming problems with equilibrium constraints using generalized convexityNew dualities for mathematical programs with vanishing constraintsDuality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applicationsDuality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificatorsMangasarian-type second- and higher-order duality for mathematical programs with complementarity constraintsOptimality and duality for nonsmooth mathematical programming problems with equilibrium constraintsUnnamed ItemSaddle point optimality criteria for mathematical programming problems with equilibrium constraintsOptimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificatorsOptimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraintsOn nonsmooth mathematical programs with equilibrium constraints using generalized convexitySome results on mathematical programs with equilibrium constraintsOn sufficiency and duality theorems for nonsmooth semi-infinite mathematical programming problem with equilibrium constraints



Cites Work


This page was built for publication: Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators