arXiv (All)
open access
A Safeguarded Projected-Gradient Framework for Complementarity Constrained Least Squares Problems
Both generalized absolute value equations (GAVEs) and linear complementarity problems (LCPs) can be formulated as least-squares problems over the complementarity set. Because this feasible set is nonconvex, projected stationarity does not in general imply zero residual. We develop a safeguarded proj
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal Policy Projections#499906
- Constraint aggregation principle in convex optimization#429980
- Revisiting transportation problems under Monge costs with applications to the Discrete Ordered Median Problem#1156280
- Cost–Benefit Analysis#291250
- Fairness of Classifiers in the Presence of Constraints between Features#151752
Record · ID 821959
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive