default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSorin-Mihai Grad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Sorin-Mihai Grad
:
Editorial for the Special Issue on "Recent Advances in Nonsmooth Optimization and Analysis". Algorithms 17(8): 349 (2024)- [j11]Sandy Bitterlich, Sorin-Mihai Grad:
Stochastic incremental mirror descent algorithms with Nesterov smoothing. Numer. Algorithms 95(1): 351-382 (2024) - 2023
- [j10]Sorin-Mihai Grad, Felipe Lara, Raul Tintaya Marcavillaca:
Relaxed-inertial proximal point type algorithms for quasiconvex minimization. J. Glob. Optim. 85(3): 615-635 (2023) - 2022
- [j9]Sorin-Mihai Grad, Felipe Lara:
An extension of the proximal point algorithm beyond convexity. J. Glob. Optim. 82(2): 313-329 (2022) - 2021
- [j8]Sorin-Mihai Grad, Felipe Lara:
Solving Mixed Variational Inequalities Beyond Convexity. J. Optim. Theory Appl. 190(2): 565-580 (2021) - [i2]Sorin-Mihai Grad, Felipe Lara:
An extension of the proximal point algorithm beyond convexity. CoRR abs/2104.08822 (2021)
2010 – 2019
- 2019
- [j7]Sorin-Mihai Grad, Oleg Wilfer:
A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality. J. Glob. Optim. 74(1): 121-160 (2019) - [i1]Radu Ioan Bot, Sorin-Mihai Grad, Dennis Meier, Mathias Staudigl:
Inducing strong convergence of trajectories in dynamical systems associated to monotone inclusions with composite structure. CoRR abs/1911.04758 (2019) - 2018
- [j6]Sorin-Mihai Grad:
Characterizations via linear scalarization of minimal and properly minimal elements. Optim. Lett. 12(4): 915-922 (2018) - 2016
- [j5]Sorin-Mihai Grad:
Closedness Type Regularity Conditions in Convex Optimization and Beyond. Frontiers Appl. Math. Stat. 2: 14 (2016) - 2015
- [b2]Sorin-Mihai Grad:
Vector Optimization and Monotone Operators via Convex Duality - Recent Advances. Vector Optimization, Springer 2015, ISBN 978-3-319-08899-0, pp. i-xvii, 1-269 - 2014
- [c2]Sorin-Mihai Grad:
Duality for Multiobjective Semidefinite Optimization Problems. OR 2014: 189-195 - 2013
- [c1]Sorin-Mihai Grad, Emilia-Loredana Pop:
Characterizing Relatively Minimal Elements via Linear Scalarization. OR 2013: 153-159 - 2012
- [j4]Radu Ioan Bot, Sorin-Mihai Grad, Gert Wanka:
Classical linear vector optimization duality revisited. Optim. Lett. 6(1): 199-210 (2012) - 2010
- [j3]Radu Ioan Bot, Sorin-Mihai Grad:
Lower semicontinuous type regularity conditions for subdifferential calculus. Optim. Methods Softw. 25(1): 37-48 (2010)
2000 – 2009
- 2009
- [b1]Radu Ioan Bot, Sorin-Mihai Grad, Gert Wanka:
Duality in Vector Optimization. Vector Optimization, Springer 2009, ISBN 978-3-642-02885-4, pp. 1-383 - 2007
- [j2]Radu Ioan Bot, Sorin-Mihai Grad, Gert Wanka:
A general approach for studying duality in multiobjective optimization. Math. Methods Oper. Res. 65(3): 417-444 (2007) - [j1]Radu Ioan Bot, Sorin-Mihai Grad, Gert Wanka:
Maximal Monotonicity for the Precomposition with a Linear Operator. SIAM J. Optim. 17(4): 1239-1252 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
