Wolfe-type duality for mathematical programs with switching constraints

DOI10.1142/S0217595922500439zbMATH Open1547.90195MaRDI QIDQ6544922FDOQ6544922

Authors: Gaoxi Li, Liping Tang, Liying Liu, Zhongping Wan 

Publication date: 28 May 2024

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

convexitydualitymathematical program with switching constraints

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Relaxation methods for mixed-integer optimal control of partial differential equations
• Optimal switching boundary control of a string to rest in finite time
• Title not available (Why is that?)
• Optimality conditions and duality for a class of nonlinear fractional programming problems.
• Mathematical Programs with Equilibrium Constraints
• Non-differentiable second order symmetric duality in mathematical programming with \(F\)-convexity
• Multiobjective second-order symmetric duality with \(F\)-convexity
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Generalized convexity and optimization. Theory and applications
• A duality theorem for non-linear programming
• Duality and optimality in multistage stochastic programming
• Operations research. Deterministic models and methods.
• On duality for mathematical programs with vanishing constraints
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• Exact penalty results for mathematical programs with vanishing constraints
• Duality methods for solving variational inequalities
• Notes on some constraint qualifications for mathematical programs with equilibrium constraints
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• A method of duality for a mixed vector equilibrium problem
• Conjugate duality for constrained optimization via image space analysis and abstract convexity
• Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
• Duality for multiobjective optimization via nonlinear Lagrangian functions
• Duality for a class of nondifferentiable multiobjective programming problems
• Duality for semi-definite and semi-infinite programming
• Canonical dual solutions to quadratic optimization over one quadratic constraint
• A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
• Duality theorem of nondifferentiable convex multiobjective programming
• Conjugate duality in generalized fractional programming
• Nonconvex penalization of switching control of partial differential equations
• Bang-bang property of time optimal null controls for some semilinear heat equation
• Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
• On the linear independence constraint qualification in disjunctive programming
• Relaxation schemes for mathematical programmes with switching constraints
• Optimality conditions and exact penalty for mathematical programs with switching constraints
• New dualities for mathematical programs with vanishing constraints
• Multiobjective Symmetric Duality in Higher-Order Fractional Variational Programming
• Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
• Topological approach to mathematical programs with switching constraints

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)