arXiv (All)
open access
Inertial parameterized Douglas-Rachford for generalized DC programming problems
We propose two new Douglas-Rachford type algorithms for solving generalized DC programming problems. More precisely, we deal with the minimization of the sum of two possibly nonsmooth convex functions from which a Fréchet differentiable convex function with a Lipschitz continuous gradient is subtrac
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
- An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization#819718
- An Inexact Augmented Lagrangian Method for $(L_0, L_1)$-Smooth Convex Optimization#809722
- Learning Generalized Hessian on Graphs for Continuous Graph Learning#667015
- GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport#1200366
- Convex Optimization with Nested Evolving Feasible Sets#615008
Record · ID 1248720
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