arXiv (All)
open access
A proximal subgradient algorithm for constrained multiobjective DC-type optimization
In this paper, we consider a class of constrained multiobjective optimization problems, where each objective function can be expressed by adding a possibly nonsmooth nonconvex function and a differentiable function with Lipschitz continuous gradient, then subtracting a weakly convex function. This e
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
- Convex Optimization with Nested Evolving Feasible Sets#615008
- Convex Optimization with Nested Evolving Feasible Sets#614041
- Lower Bounds for Nonconvex-Concave Minimax Optimization#1083690
- A capacity scaling algorithm for convex cost submodular flows#429975
- Pareto sensitivity, most-changing sub-fronts, and knee solutions#1117215
Record · ID 925885
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