Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming

DOI10.1007/S10107-019-01380-5MaRDI QIDQ2188244zbMATH OpenOpenAlexWikidataFDO

Authors P. Mehlitz

Publication date 10 June 2020

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-019-01380-5

zbMATH Keywords

nonlinear programmingconstraint qualificationsoptimality conditionsswitching constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• Relaxation schemes for mathematical programmes with switching constraints
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• Notes on some constraint qualifications for mathematical programs with equilibrium constraints

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• A Necessary and Sufficient Qualification for Constrained Optimization
• A convex penalty for switching control of partial differential equations
• A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
• Abadie-type constraint qualification for mathematical programs with equilibrium constraints
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
• How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
• Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
• New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
• Nonconvex penalization of switching control of partial differential equations
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Notes on some constraint qualifications for mathematical programs with equilibrium constraints
• On M-stationary points for mathematical programs with equilibrium constraints
• On computation of generalized derivatives of the normal-cone mapping and their applications
• On estimating the regular normal cone to constraint systems and stationarity conditions
• On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints
• Operations research. Deterministic models and methods.
• Optimal control of a diffusion/reaction/switching system
• Optimal control of partial differential equations. Theory, methods and applications
• Optimal switching boundary control of a string to rest in finite time
• Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• Optimization Modelling
• Relaxation methods for mixed-integer optimal control of partial differential equations
• Second-order optimality conditions for mathematical programs with equilibrium constraints
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• Switching control
• Switching in systems and control
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Time optimal controls of semilinear heat equation with switching control
• Variational Analysis

Cited in

(30)

• A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
• On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints
• Inexact penalty decomposition methods for optimization problems with geometric constraints
• Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints
• Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds
• scientific article; zbMATH DE number 7733454 (Why is no real title available?)
• Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
• Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds
• Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
• Optimality conditions and constraint qualifications for cardinality constrained optimization problems
• Optimality conditions, approximate stationarity, and applications -- a story beyond Lipschitzness
• An augmented Lagrangian method for optimization problems with structured geometric constraints
• Sequential optimality conditions for cardinality-constrained optimization problems with applications
• An exact penalty approach for general ℓ ₀ -sparse optimization problems
• Optimality conditions and exact penalty for mathematical programs with switching constraints
• Relaxed constant positive linear dependence constraint qualification for disjunctive systems
• Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
• Topological approach to mathematical programs with switching constraints
• On the linear independence constraint qualification in disjunctive programming
• The Frèchet normal cone of optimization problems with switching constraints
• Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
• Relaxation schemes for mathematical programmes with switching constraints
• Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
• Directionally variational analysis and second-order optimality conditions for mathematical programs with switching constraints
• Constraint qualifications for nonsmooth multiobjective programming problems with switching constraints on Hadamard manifolds
• Projected gradient descent accumulates at Bouligand stationary points
• Relaxation methods for optimal switching control of PDE-dynamical systems
• Wolfe-type duality for mathematical programs with switching constraints

This page was built for publication: Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188244)