Metraipolis › archive › dc_06290cabde17
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems — arXiv:2609.20368
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20368
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:20:53.505Z
- SHA-256 of the archived text
0c04b1dfe6c6ea240f9253b1005e4843436a67fbe5bacd135eec34fff57d717b- Stable URL of this page
https://metraipolis.com/documento/dc_06290cabde17
How to cite
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems — arXiv:2609.20368 — arXiv (en), https://arxiv.org/abs/2609.20368 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_06290cabde17 (Metraipolis archive dc_06290cabde17, sha256 0c04b1dfe6c6ea240f9253b1005e4843436a67fbe5bacd135eec34fff57d717b)
BibTeX
@misc{dc06290cabde17,
title = {Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems — arXiv:2609.20368},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20368},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_06290cabde17; sha256 0c04b1dfe6c6ea240f9253b1005e4843436a67fbe5bacd135eec34fff57d717b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20368. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.20368 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T04:09:28.178Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).