On duality for mathematical programs with vanishing constraints
From MaRDI portal
Recommendations
- New dualities for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints involving strongly invex functions
- Wolfe type duality for nonsmooth optimization problems with vanishing constraints
- Lagrange type duality and saddle point optimality criteria for mathematical programs with vanishing constraints
- Duality for multiobjective optimization problem with vanishing constraints
Cites work
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 3291743 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming
- A dual parametrization method for convex semi-infinite programming
- A duality theorem for non-linear programming
- A new duality theory for mathematical programming
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Active-set Newton methods for mathematical programs with vanishing constraints
- Duality and optimality in multistage stochastic programming
- Duality for constrained multifacility location problems with mixed norms and applications
- Duality for nonsmooth semi-infinite programming problems
- Duality for optimization problems in Banach algebras
- Duality in Vector Optimization
- Exact penalty results for mathematical programs with vanishing constraints
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- First-order optimality conditions and duality results for multi-objective optimisation problems
- Generalized convexity and optimization. Theory and applications
- Generalized convexity and vector optimization
- Invexity and optimization
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Nondifferentiable multiobjective Mond-Weir type second-order symmetric duality over cones
- Nonsmooth minimax programming problems with \(V\)-\(r\)-invex functions
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- Parameter-free dual models for fractional programming with generalized invexity
- Quality tolerancing and conjugate duality
- Regression tasks in machine learning via Fenchel duality
- Robust duality for generalized convex programming problems under data uncertainty
- Stability analysis for parametric mathematical programs with geometric constraints and its applications
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity
- The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
- V-invex functions and vector optimization.
- Wolfe duality and Mond-Weir duality via perturbations
Cited in
(32)- On quasidifferentiable mathematical programs with equilibrium constraints
- Lagrange type duality and saddle point optimality criteria for mathematical programs with vanishing constraints
- Robust mathematical programming problems involving vanishing constraints via strongly invex functions
- Mond-Weir duality results for nondifferentiable mathematical programming with vanishing constraints
- On stationarity for nonsmooth multiobjective problems with vanishing constraints
- Mangasarian-type second- and higher-order duality for mathematical programs with complementarity constraints
- Mathematical programs with vanishing constraints involving strongly invex functions
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
- Wolfe type duality for nonsmooth optimization problems with vanishing constraints
- Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Optimality results for nondifferentiable vector optimization problems with vanishing constraints
- On directionally differentiable multiobjective programming problems with vanishing constraints
- Duality for multiobjective optimization problem with vanishing constraints
- Optimality analysis and duality conditions for a class of conic semi-infinite program having vanishing constraints
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints
- On multiobjective fractional programs with vanishing constraints
- Wolfe type duality on quasidifferentiable mathematical programs with vanishing constraints
- New dualities for mathematical programs with vanishing constraints
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
- On mathematical programs with equilibrium constraints under data uncertainty
- Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints on Hadamard manifolds
- Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
- Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
- A linearized approach for solving differentiable vector optimization problems with vanishing constraints
- Wolfe-type duality for mathematical programs with switching constraints
This page was built for publication: On duality for mathematical programs with vanishing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338925)
