arXiv (All)
open access
Multi-split Multiple-sets Implicit Convex Feasibility Seeking As Split Inverse Problems
We introduce a new class of problems, termed multi-split multiple-sets implicit convex feasibility problems (MSMS-ICFPs), define a proximity function for it and analyze its properties under certain assumptions on the involved general point-to-set operators. Additionally, we discuss its properties fo
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
- Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition#31292
- Bundling Complements#926115
- Complexity of Multiblock Convex-Concave Saddle-Point Problems with General Smooth Coupling#1296663
- Scen-Opt: A Scenario Optimization Toolbox for Data-Driven Convex Programming#1217581
- FrontierMath Erdős#1051543
Record · ID 1491599
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