Wolfe type duality for nonsmooth optimization problems with vanishing constraints
From MaRDI portal
Publication:5092045
DOI10.30495/JME.V0I0.2110zbMATH Open1491.90171MaRDI QIDQ5092045FDOQ5092045
Authors: Marjan Ghobadzadeh, Kamal Fallahi, Nader Kanzi 
Publication date: 28 July 2022
Recommendations
- On duality for mathematical programs with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
- Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
- Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
- Lagrange type duality and saddle point optimality criteria for mathematical programs with vanishing constraints
optimality conditionsduality resultsClarke subdifferentialconstraint qualificationvanishing constraints
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cites Work
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Invexity and optimization
- V-invex functions and vector optimization.
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- On duality for mathematical programs with vanishing constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Regression tasks in machine learning via Fenchel duality
- The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Wolfe duality and Mond-Weir duality via perturbations
- Generalized convexity and vector optimization.
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
Cited In (8)
- Title not available (Why is that?)
- Lagrange type duality and saddle point optimality criteria for mathematical programs with vanishing constraints
- Mond-Weir duality results for nondifferentiable mathematical programming with vanishing constraints
- Mathematical programs with vanishing constraints involving strongly invex functions
- On duality for mathematical programs with vanishing constraints
- Wolfe type duality on quasidifferentiable mathematical programs with vanishing constraints
- Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
This page was built for publication: Wolfe type duality for nonsmooth optimization problems with vanishing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092045)
