Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka, Ekaterina Kostina
Abstract
Mathematical Programs with Blocks of Vanishing Constraints (MP-BVCs) are a challenging class of optimization problems due to the loss of standard constraint qualifications. Based on existing theory for classical MPVCs, i.e., MPBVC with block size one, we extend the constraint qualification theory for MPBVCs and show that the known LICQ-type condition for MPBVCs implies the Guignard Constraint Qualification (GCQ). A novel piecewise gradient flow approach converges under GCQ. It directly computes strongly stationary points and is an extension of the piecewise gradient flow approach for classic MPVC problems. Numerical experiments on several truss topology design instances with two and even three applied load forces demonstrate the robustness and effectiveness of the method.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Near-Optimal Pure Single-Loop Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization
Minhao Zhang, Zi Xu