Metraipolis › archive › dc_5a71fc065e6a

Dynamical Systems and Nonconvex Quadratic Programs — arXiv:2609.06088

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06088
License (as archived)
CC0-1.0
Archived
2026-10-16T14:24:00.704Z
SHA-256 of the archived text
cee4ab06649b15e3bb0df68a929f374f568862ae012f8d34fb7c99fe01fe5156
Stable URL of this page
https://metraipolis.com/documento/dc_5a71fc065e6a

How to cite

Dynamical Systems and Nonconvex Quadratic Programs — arXiv:2609.06088 — arXiv (en), https://arxiv.org/abs/2609.06088 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5a71fc065e6a (Metraipolis archive dc_5a71fc065e6a, sha256 cee4ab06649b15e3bb0df68a929f374f568862ae012f8d34fb7c99fe01fe5156)
BibTeX
@misc{dc5a71fc065e6a,
  title = {Dynamical Systems and Nonconvex Quadratic Programs — arXiv:2609.06088},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06088},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5a71fc065e6a; sha256 cee4ab06649b15e3bb0df68a929f374f568862ae012f8d34fb7c99fe01fe5156},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06088. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper studies a dynamical system approach for solving indefinite quadratic programming problems subject to linear constraints. We investigate the convergence of the trajectory generated by the system to a Karush-Kuhn-Tucker point of the quadratic programs. In addition, we derive an estimate for the distance between the trajectory and a solution of the problem. We further prove that the objective value is decreasing along the trajectory. An illustrative example and a numerical test are presented to demonstrate the behavior and performance of the proposed method.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.06088 — 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-16T14:09:21.654Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).