arXiv (OAI Expanded)
open access
Interior-point proximal methods for nonsmooth optimization in Hilbert spaces with cone-ordered constraints
We study an inexact interior-point method for nonsmooth, nonconvex optimization problems with conic inequality constraints. The objective function is given by the sum of a smooth, possibly nonconvex term and a convex, possibly nonsmooth term with a computable proximal mapping. The constraints are 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
- Graph Domain Adaptation via Theory-Grounded Spectral Regularization.#351318
- On Hybrid Expressivism about Aesthetic Judgments#725268
- Learning Decentralized Multi-robot PointGoal Navigation#257790
- Accelerated Decentralized Stochastic Gradient Descent for Strongly Convex Optimization#266154
- Feasible Cognition Requires Latent State#181093
Record · ID 1083310
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