arXiv (All)
open access
Regularized extragradient method for structured bilevel optimization in continuous and discrete time
In a real Hilbert space, we study a bilevel optimization problem that consists in minimizing an outer convex function over the zero set of a maximally monotone operator. In the smooth setting, where the outer objective is convex and Fréchet differentiable and the inner operator is single-valued, con
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 Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization#160891
- A Review of Bilevel Optimization: Methods, Emerging Applications, and Recent Advancements#1117272
- Optimal Stochastic Bilevel Optimization with First-Order Oracles#1157114
- An inertial extrapolation method for convex simple bilevel optimization#196252
- Superquantile-Gibbs Relaxation for Minima-selection in Bilevel Optimization#635587
Record · ID 926215
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