Optimality conditions and exact penalty for mathematical programs with switching constraints
From MaRDI portal
Publication:2046549
Recommendations
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- 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
- Wolfe-type duality for mathematical programs with switching constraints
- Exact penalty results for mathematical programs with vanishing constraints
Cites work
- A relaxed constant positive linear dependence constraint qualification and applications
- Directional derivative of the marginal function in nonlinear programming
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- Linearized M-stationarity conditions for general optimization problems
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- New results on constraint qualifications for nonlinear extremum problems and extensions
- New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences
- 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
- On calculating the normal cone to a finite union of convex polyhedra†
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs
- On directionally dependent subdifferentials
- On estimating the regular normal cone to constraint systems and stationarity conditions
- On relaxed constant rank regularity condition in mathematical programming
- On relaxing the Mangasarian-Fromovitz constraint qualification
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- On the linear independence constraint qualification in disjunctive programming
- Optimal control of a diffusion/reaction/switching system
- 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 and nonsmooth analysis
- Relaxation methods for mixed-integer optimal control of partial differential equations
- Relaxation schemes for mathematical programmes with switching constraints
- Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Two new weak constraint qualifications and applications
- Variational Analysis
- Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
Cited in
(23)- On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
- The projection onto the cross
- Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
- On the linear independence constraint qualification in disjunctive programming
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- The Frèchet normal cone of optimization problems with switching constraints
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints
- scientific article; zbMATH DE number 7733454 (Why is no real title available?)
- Optimality Conditions and Exact Penalty for Mathematical Programs with Switching Constraints
- Constraint qualifications for nonsmooth multiobjective programming problems with switching constraints on Hadamard manifolds
- Wolfe-type duality for mathematical programs with switching constraints
- Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems
- On the directional asymptotic approach in optimization theory
- Global convergence of an augmented Lagrangian method for nonlinear programming via Riemannian optimization
- An exact penalty approach for general ℓ 0 -sparse optimization problems
- Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
- Directionally variational analysis and second-order optimality conditions for mathematical programs with switching constraints
- Optimality conditions for bilevel programmes via Moreau envelope reformulation*
- On generalized alternative stationarity for mathematical programs with switching constraints
This page was built for publication: Optimality conditions and exact penalty 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 Q2046549)
