arXiv (All)
open access
A Tight Surrogate-Based Adaptive Step Size for the Multiobjective Conditional Gradient Method
The multiobjective conditional gradient (MCondG) method is an effective descent-type algorithm for solving constrained multiobjective optimization problems. In this algorithm, the adaptive step size is derived by minimizing a one-dimensional convex quadratic surrogate function, which guarantees a su
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
- Solving Large-Scale Multiobjective Optimization Problems With Sparse Optimal Solutions via Unsupervised Neural Networks#19736
- Combining Multi-Objective Bayesian Optimization with Reinforcement Learning for TinyML#1130430
- 6TiSCH Minimal Scheduling Function (MSF)#502479
- When Gradients Collide: Failure Modes of Multi-Objective Prompt Optimization for LLM Judges#224507
- Hybrid gradient descent method for galactic modelling using the enhanced newtonian dynamics framework#655219
Record · ID 1036220
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