Rohollah Garmanjani


AuthID: R-00H-263

Confirmed Publications: 5



1
TITLE: Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
AUTHORS: R. Garmanjani ;
PUBLISHED: 2023, SOURCE: OPTIMIZATION LETTERS, VOLUME: 17, ISSUE: 5
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
2
TITLE: A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization  Full Text
AUTHORS: R. Garmanjani ;
PUBLISHED: 2022, SOURCE: OPTIMIZATION, VOLUME: 71, ISSUE: 6
INDEXED IN: Scopus WOS CrossRef: 1
IN MY: ORCID
3
TITLE: Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization  Full Text
AUTHORS: Custodio, AL ; Diouane, Y; R. Garmanjani ; Riccietti, E;
PUBLISHED: 2021, SOURCE: JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, VOLUME: 188, ISSUE: 1
INDEXED IN: Scopus WOS CrossRef: 3
IN MY: ORCID
4
TITLE: TRUST-REGION METHODS WITHOUT USING DERIVATIVES: WORST CASE COMPLEXITY AND THE NONSMOOTH CASE  Full Text
AUTHORS: R. Garmanjani ; Judice, D; Vicente, LN;
PUBLISHED: 2016, SOURCE: SIAM JOURNAL ON OPTIMIZATION, VOLUME: 26, ISSUE: 4
INDEXED IN: Scopus WOS CrossRef: 29
IN MY: ORCID
5
TITLE: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization  Full Text
AUTHORS: R. Garmanjani ; Vicente, LN ;
PUBLISHED: 2013, SOURCE: IMA JOURNAL OF NUMERICAL ANALYSIS, VOLUME: 33, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 26
IN MY: ORCID

footer slogan

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service