Optimal control problems with control complementarity constraints: existence results, optimality conditions, and a penalty method

DOI10.1080/10556788.2019.1604705zbMath1429.49025arXiv1809.09920OpenAlexW3102913601MaRDI QIDQ4972549

Uwe Prüfert, Christian Clason, Yu Deng, Patrick Mehlitz

Publication date: 25 November 2019

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.09920

zbMATH Keywords

optimal controloptimality conditionspenalty methodcomplementarity constraintsFischer-Burmeister function

Mathematics Subject Classification ID

Optimality conditions for problems involving partial differential equations (49K20) Numerical methods based on necessary conditions (49M05) Programming in abstract spaces (90C48) Discrete approximations in optimal control (49M25) Optimality conditions for problems in abstract spaces (49K27)

Related Items

Analysis and Solution Methods for Bilevel Optimal Control Problems ⋮ Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness ⋮ An Optimal Control Problem with Terminal Stochastic Linear Complementarity Constraints ⋮ A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces ⋮ A comparison of solution approaches for the numerical treatment of or-constrained optimization problems ⋮ On an optimal control problem with gradient constraints ⋮ Coupled versus decoupled penalization of control complementarity constraints ⋮ Bilevel Optimal Control: Existence Results and Stationarity Conditions

Uses Software

• OOPDE

Cites Work

• A convex penalty for switching control of partial differential equations
• Mathematical programs with complementarity constraints in Banach spaces
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
• On NCP-functions
• A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
• Nonconvex penalization of switching control of partial differential equations
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• The limiting normal cone to pointwise defined sets in Lebesgue spaces
• Optimal control in first-order Sobolev spaces with inequality constraints
• Differential variational inequalities
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A convex analysis approach to optimal controls with switching structure for partial differential equations
• Weak and strong stationarity in generalized bilevel programming and bilevel optimal control
• Necessary Optimality Conditions for Optimal Control Problems with Equilibrium Constraints
• Optimal Control Problems with Mixed Constraints
• Variational Analysis in Sobolev andBVSpaces
• On NEMYTSKIJ Operators inLp-Spaces of Abstract Functions
• Regularity Properties of a Semismooth Reformulation of Variational Inequalities
• A special newton-type optimization method
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• The limiting normal cone of a complementarity set in Sobolev spaces
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Comparison of optimality systems for the optimal control of the obstacle problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item