arXiv (All)
open access
MPFA: A Pareto Front Approximation Method for Riemannian Bi-objective Optimization
We propose a Pareto front approximation (MPFA) method for smooth bi-objective optimization problems on Riemannian manifolds based on a Hermite interpolation technique. Compared with the existing multiobjective optimization numerical algorithms, the proposed method can generate a continuous approxima
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
- Hyperparameter optimization of YOLO using differential evolution, multi-fidelity optimization, and Bayesian optimization.#227821
- Averaged proximal reflected gradient method for monotone variational inequalities#973988
- Chen-Ricci and Hineva Inequalities For Riemannian Submersions and Riemannian Maps With Applications#1076055
- Extragradient methods with complexity guarantees for hierarchical variational inequalities#925881
- Optimal Momentum Methods for Stochastic Multilevel Compositional Optimization#1156844
Record · ID 996674
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