Wolfe-type duality for mathematical programs with switching constraints
From MaRDI portal
(Redirected from Wolfe-type duality for mathematical programs with switching constraints)
Recommendations
- On duality for mathematical programs with vanishing constraints
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- scientific article; zbMATH DE number 7297336
- Wolfe-type duality for mathematical programs with equilibrium constraints
- Optimality conditions and exact penalty for mathematical programs with switching constraints
Cites work
- A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
- A duality theorem for non-linear programming
- A method of duality for a mixed vector equilibrium problem
- Bang-bang property of time optimal null controls for some semilinear heat equation
- Canonical dual solutions to quadratic optimization over one quadratic constraint
- Conjugate duality for constrained optimization via image space analysis and abstract convexity
- Conjugate duality in generalized fractional programming
- Duality and optimality in multistage stochastic programming
- Duality for a class of nondifferentiable multiobjective programming problems
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Duality for semi-definite and semi-infinite programming
- Duality methods for solving variational inequalities
- Duality theorem of nondifferentiable convex multiobjective programming
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Exact penalty results for mathematical programs with vanishing constraints
- Generalized convexity and optimization. Theory and applications
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- Multiobjective second-order symmetric duality with \(F\)-convexity
- Multiobjective Symmetric Duality in Higher-Order Fractional Variational Programming
- New dualities for mathematical programs with vanishing constraints
- Non-differentiable second order symmetric duality in mathematical programming with \(F\)-convexity
- Nonconvex penalization of switching control of partial differential equations
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- On duality for mathematical programs with vanishing constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- On the linear independence constraint qualification in disjunctive programming
- Operations research. Deterministic models and methods.
- Optimal switching boundary control of a string to rest in finite time
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- Relaxation methods for mixed-integer optimal control of partial differential equations
- Relaxation schemes for mathematical programmes with switching constraints
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Topological approach to mathematical programs with switching constraints
Cited in
(1)
This page was built for publication: Wolfe-type duality for mathematical programs with switching constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544922)
