default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir F. Demyanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j15]Vladimir F. Demyanov, Vasily N. Malozemov
:
Optimality Conditions in Terms of Alternance: Two Approaches. J. Optim. Theory Appl. 162(3): 805-820 (2014)- 2013
- [j14]Majid E. Abbasov, Vladimir F. Demyanov:
Proper and adjoint exhausters in nonsmooth analysis: optimality conditions. J. Glob. Optim. 56(2): 569-585 (2013) - [j13]Majid E. Abbasov, Vladimir F. Demyanov:
Adjoint Coexhausters in Nonsmooth Analysis and Extremality Conditions. J. Optim. Theory Appl. 156(3): 535-553 (2013) - 2010
- [j12]Veronika V. Demyanova, Vladimir F. Demyanov:
One-dimensional identification problem and ranking parameters. J. Glob. Optim. 48(1): 29-40 (2010)
2000 – 2009
- 2009
- [r5]Vladimir F. Demyanov:
Dini and Hadamard Derivatives in Optimization. Encyclopedia of Optimization 2009: 710-716 - [r4]Vladimir F. Demyanov:
Minimax: Directional Differentiability. Encyclopedia of Optimization 2009: 2075-2079 - [r3]Vladimir F. Demyanov:
Nondifferentiable Optimization: Minimax Problems. Encyclopedia of Optimization 2009: 2595-2602 - [r2]Vladimir F. Demyanov:
Quasidifferentiable Optimization: Algorithms for QD Functions. Encyclopedia of Optimization 2009: 3178-3184 - [r1]Vladimir F. Demyanov:
Quasidifferentiable Optimization: Optimality Conditions. Encyclopedia of Optimization 2009: 3205-3213 - 2008
- [j11]Vladimir F. Demyanov, Vera Roshchina:
Exhausters, optimality conditions and related problems. J. Glob. Optim. 40(1-3): 71-85 (2008) - 2006
- [j10]Veronika V. Demyanova, Vladimir F. Demyanov:
The Method of Virtual Experts in Mathematical Diagnostics. J. Glob. Optim. 35(2): 215-234 (2006) - 2005
- [j9]Vladimir F. Demyanov:
An old problem and new tools. Optim. Methods Softw. 20(1): 53-70 (2005) - [j8]Vladimir F. Demyanov, Manlio Gaudioso:
Preface. Optim. Methods Softw. 20(2-3): 187-188 (2005) - [j7]Vladimir F. Demyanov:
Mathematical diagnostics via nonsmooth analysis. Optim. Methods Softw. 20(2-3): 197-218 (2005) - 2002
- [j6]Vladimir F. Demyanov, Adil M. Bagirov, Alexander M. Rubinov:
A method of truncated codifferential with application to some problems of cluster analysis. J. Glob. Optim. 23(1): 63-80 (2002) - [j5]Alexey V. Demyanov, Vladimir F. Demyanov, Vasily N. Malozemov:
Minmaxmin problems revisited. Optim. Methods Softw. 17(5): 783-804 (2002) - 2000
- [j4]Vladimir F. Demyanov:
Conditions for an Extremum in Metric Spaces. J. Glob. Optim. 17(1-4): 55-63 (2000)
1990 – 1999
- 1998
- [j3]Vladimir F. Demyanov, Franco Giannessi, V. V. Karelin:
Optimal Control Problems via Exact Penalty Functions. J. Glob. Optim. 12(3): 215-223 (1998) - 1997
- [j2]Vladimir F. Demyanov, Vaithilingam Jeyakumar:
Hunting for a Smaller Convex Subdifferential. J. Glob. Optim. 10(3): 305-326 (1997) - 1995
- [j1]Vladimir F. Demyanov:
Book review. J. Glob. Optim. 6(3): 321-323 (1995)
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-04-25 05:56 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:
