Journal article · 2025 · Open access
Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization
Optimization Eruditorum, 2(3) · Published 19 October 2025 · DOI 10.69829/oper-025-0203-ta01
In brief
“Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization” is a 2025 journal article, published in Optimization Eruditorum. OpenAlex counts 0 citations as of 16 November 2026. It is open access: the full text is free to read at Optimization Eruditorum.
- Citations
- 0
Abstract
This paper introduces a gradient-free method for solving a class of nonsmooth nonconvex multiobjective optimization problems.Under standard regularity conditions, we establish a non-asymptotic convergence rate of the proposed algorithm, where optimality is quantified in terms of (δ, ϵ)-Goldstein stationarity measure.Numerical experiments are presented to demonstrate the effectiveness of the proposed method.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization. (2025). Optimization Eruditorum, 2(3). https://doi.org/10.69829/oper-025-0203-ta01
MLA 9
“Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization.” Optimization Eruditorum, vol. 2, no. 3, 2025. https://doi.org/10.69829/oper-025-0203-ta01.
Chicago
2025. “Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization.” Optimization Eruditorum 2 (3). https://doi.org/10.69829/oper-025-0203-ta01.
Harvard
(2025) ‘Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization’, Optimization Eruditorum, 2(3). doi:10.69829/oper-025-0203-ta01.
IEEE
“Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization,” Optimization Eruditorum, vol. 2, no. 3, 2025, doi: 10.69829/oper-025-0203-ta01.
BibTeX
@article{anon2025gradient,
title = {{Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization}},
journal = {Optimization Eruditorum},
year = {2025},
volume = {2},
number = {3},
doi = {10.69829/oper-025-0203-ta01},
url = {https://doi.org/10.69829/oper-025-0203-ta01}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- nonsmooth optimization
- non-convex optimization
- multi-objective optimization
- non-asymptotic convergence rates
- optimality conditions
- regularity conditions
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Gradient-Free Methods for Nonsmooth Nonconvex Multiobjective Optimization. (2025). Optimization Eruditorum, 2(3). https://doi.org/10.69829/oper-025-0203-ta01
How many times has this paper been cited?
0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at Optimization Eruditorum.
What is the DOI of this paper?
10.69829/oper-025-0203-ta01. The permanent link is https://doi.org/10.69829/oper-025-0203-ta01.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.