Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
From MaRDI portal
Publication:2188244
DOI10.1007/S10107-019-01380-5zbMATH Open1480.90230OpenAlexW2921027941WikidataQ128265151 ScholiaQ128265151MaRDI QIDQ2188244FDOQ2188244
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
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
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Variational Analysis
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Switching in systems and control
- A convex penalty for switching control of partial differential equations
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Title not available (Why is that?)
- Relaxation methods for mixed-integer optimal control of partial differential equations
- Optimal control of a diffusion/reaction/switching system
- Optimale Steuerung partieller Differentialgleichungen
- Optimal switching boundary control of a string to rest in finite time
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Switching control
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- On M-stationary points for mathematical programs with equilibrium constraints
- Operations research. Deterministic models and methods.
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
- A Necessary and Sufficient Qualification for Constrained Optimization
- A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
- On estimating the regular normal cone to constraint systems and stationarity conditions
- Optimization Modelling
- On computation of generalized derivatives of the normal-cone mapping and their applications
- Time optimal controls of semilinear heat equation with switching control
- Nonconvex penalization of switching control of partial differential equations
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
Cited In (24)
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness
- On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds
- Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints
- Title not available (Why is that?)
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- Title not available (Why is that?)
- 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
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
- On the linear independence constraint qualification in disjunctive programming
- Relaxation schemes for mathematical programmes with switching constraints
- Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Constraint qualifications for nonsmooth multiobjective programming problems with switching constraints on Hadamard manifolds
- 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)
