On duality for mathematical programs with vanishing constraints
From MaRDI portal
Publication:338925
DOI10.1007/s10479-015-1814-8zbMath1348.90623OpenAlexW2009130125MaRDI QIDQ338925
Publication date: 7 November 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1814-8
generalized convexityMond-Weir dualduality resultsmathematical programs with vanishing constraintsWolfe dual
Related Items (19)
On stationarity for nonsmooth multiobjective problems with vanishing constraints ⋮ Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints ⋮ Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints ⋮ Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators ⋮ On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity ⋮ Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints ⋮ New dualities for mathematical programs with vanishing constraints ⋮ Mathematical programs with vanishing constraints involving strongly invex functions ⋮ Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints ⋮ On mathematical programs with equilibrium constraints under data uncertainty ⋮ Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications ⋮ On quasidifferentiable mathematical programs with equilibrium constraints ⋮ Mangasarian-type second- and higher-order duality for mathematical programs with complementarity constraints ⋮ On directionally differentiable multiobjective programming problems with vanishing constraints ⋮ Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints ⋮ Unnamed Item ⋮ On nonsmooth mathematical programs with equilibrium constraints using generalized convexity ⋮ Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Regression tasks in machine learning via Fenchel duality
- Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity
- Robust duality for generalized convex programming problems under data uncertainty
- Duality for nonsmooth semi-infinite programming problems
- Duality for optimization problems in Banach algebras
- Exact penalty results for mathematical programs with vanishing constraints
- Duality for constrained multifacility location problems with mixed norms and applications
- Invexity and optimization
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Generalized convexity and optimization. Theory and applications
- Generalized convexity and vector optimization
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Nondifferentiable multiobjective Mond-Weir type second-order symmetric duality over cones
- Wolfe duality and Mond-Weir duality via perturbations
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Duality and optimality in multistage stochastic programming
- Parameter-free dual models for fractional programming with generalized invexity
- Active-set Newton methods for mathematical programs with vanishing constraints
- First-order optimality conditions and duality results for multi-objective optimisation problems
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- V-invex functions and vector optimization.
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
- G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming
- A new duality theory for mathematical programming
- Duality in Vector Optimization
- Nonsmooth minimax programming problems withV−r-invex functions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- A duality theorem for non-linear programming
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- Stability Analysis for Parametric Mathematical Programs with Geometric Constraints and Its Applications
- A dual parametrization method for convex semi-infinite programming
- The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
- Quality tolerancing and conjugate duality
This page was built for publication: On duality for mathematical programs with vanishing constraints
