Repositorio Institucional Universidad Técnica Federico Santa María
metadata only
Primal-dual splitting algorithms for constrained monotone inclusions
In this thesis we propose an efficient splitting algorithm for solving constrained primal-dual monotone inclusions with a normal cone to a closed vector subspace. Our algorithm incorporates an additional projection onto a set of constraints, which represents a priori information on the solutions. Th
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
- A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization#1247369
- Sparse Cuts for the Positive Semidefinite Cone#793594
- Sparse Cuts for the Positive Semidefinite Cone#789590
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
- DR-DAQP: A Hybrid Operator Splitting and Active-Set Solver for Affine Variational Inequalities#1035451
Record · ID 1347808
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