The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
Open accessAbstract
One considers the context of the concurrent optimization of several criteria J i ( Y ) ( i = 1 , … , n ), supposed to be smooth functions of the design vector Y ∈ R N ( n ⩽ N ). An original constructive solution is given to the problem of identifying a descent direction common to all criteria when the current design-point Y 0 is not Pareto-optimal. This leads us to generalize the classical steepest-descent method to the multiobjective context by utilizing this direction for the descent. The algorithm is then proved to converge to a Pareto-stationary design-point.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Nonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
Nonlinear Multiobjective Optimization
Mardle, S., & Miettinen, K. M. (2000) · The Journal of the Operational Research Society · doi:10.2307/254267 · Cited by 3,049
(2007) · Springer eBooks · doi:10.1007/978-0-387-71107-2 · Cited by 2,687
Viviani, G. L. (1985) · IEEE Power Engineering Review · doi:10.1109/mper.1985.5528460 · Cited by 289
Cited by
Multi-Task Learning for Dense Prediction Tasks: A Survey
Vandenhende, S., Georgoulis, S., Van Gansbeke, W., Proesmans, M., Dai, D., & Van Gool, L. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3054719 · Cited by 840
Multi-Task Learning with Deep Neural Networks: A Survey
Crawshaw, M. (2020) · arXiv · doi:10.48550/arxiv.2009.09796 · Cited by 428
Review of numerical optimization techniques for meta-device design [Invited]
Campbell, S. D., Sell, D., Jenkins, R. P., Whiting, E. B., Fan, J. A., & Werner, D. H. (2019) · Optical Materials Express · doi:10.1364/ome.9.001842 · Cited by 322
CrowdGuard: Federated Backdoor Detection in Federated Learning
Rieger, P., Krauß, T., Miettinen, M., Dmitrienko, A., & Sadeghi, A.-R. (2024) · Proceedings 2024 Network and Distributed System Security Symposium · doi:10.14722/ndss.2024.23233 · Cited by 36
On Accelerating Edge AI: Optimizing Resource-Constrained Environments
Sander, J., Cohen, A., Dasari, V. R., Venable, B., & Jalaian, B. (2025) · arXiv · doi:10.48550/arxiv.2501.15014 · Cited by 2
Metadata
- Authors
- Désidéri, J.-A.
- Venue
- Comptes Rendus. Mathématique
- Publisher
- MathDoc/Centre Mersenne
- Published
- 2012-03-01
- Volume
- 350
- Issue
- 5-6
- Pages
- 313-318
- ISSN
- 1631-073X (ISSN-L)
- 1778-3569
- OpenAlex
- W2060727197
- Cited by
- 391
- References
- 5
- FWCI
- 4.75
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.