default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Shikhman
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j18]David Müller
, Vladimir Shikhman:
Network manipulation algorithm based on inexact alternating minimization. Comput. Manag. Sci. 19(4): 627-664 (2022)- [j17]Sebastian Lämmel, Vladimir Shikhman:
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization. J. Glob. Optim. 82(2): 219-242 (2022) - [j16]David Müller, Yurii E. Nesterov, Vladimir Shikhman:
Discrete Choice Prox-Functions on the Simplex. Math. Oper. Res. 47(1): 485-507 (2022)
2010 – 2019
- 2018
- [j15]Yurii E. Nesterov, Vladimir Shikhman:
Dual subgradient method with averaging for optimal resource allocation. Eur. J. Oper. Res. 270(3): 907-916 (2018) - 2017
- [j14]Yurii E. Nesterov, Vladimir Shikhman:
Distributed Price Adjustment Based on Convex Analysis. J. Optim. Theory Appl. 172(2): 594-622 (2017) - 2016
- [j13]Dominik Dorsch, Walter Gómez, Vladimir Shikhman:
Sufficient optimality conditions hold for almost all nonlinear semidefinite programs. Math. Program. 158(1-2): 77-97 (2016) - 2015
- [j12]Yurii E. Nesterov, Vladimir Shikhman:
Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization. J. Optim. Theory Appl. 165(3): 917-940 (2015) - [c1]Yurii E. Nesterov, Vladimir Shikhman:
Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction. SAGT 2015: 312-313 - 2013
- [j11]Dominik Dorsch, Hubertus Th. Jongen, Vladimir Shikhman:
On Intrinsic Complexity of Nash Equilibrium Problems and Bilevel Optimization. J. Optim. Theory Appl. 159(3): 606-634 (2013) - [j10]Dominik Dorsch, Hubertus Th. Jongen, Vladimir Shikhman:
On Structure and Computation of Generalized Nash Equilibria. SIAM J. Optim. 23(1): 452-474 (2013) - 2012
- [j9]Dominik Dorsch, Vladimir Shikhman, Oliver Stein:
Mathematical programs with vanishing constraints: critical point theory. J. Glob. Optim. 52(3): 591-605 (2012) - [j8]Hubertus Th. Jongen, Vladimir Shikhman, Sonja Steffensen:
Characterization of strong stability for C-stationary points in MPCC. Math. Program. 132(1-2): 295-308 (2012) - [j7]Hubertus Th. Jongen, Vladimir Shikhman:
Bilevel optimization: on the structure of the feasible set. Math. Program. 136(1): 65-89 (2012) - 2011
- [j6]Hubertus Th. Jongen, Vladimir Shikhman:
Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz. SIAM J. Optim. 21(1): 193-211 (2011) - 2010
- [j5]Francisco Guerra Vázquez, Hubertus Th. Jongen, Vladimir Shikhman:
General Semi-Infinite Programming: Symmetric Mangasarian-Fromovitz Constraint Qualification and the Closure of the Feasible Set. SIAM J. Optim. 20(5): 2487-2503 (2010)
2000 – 2009
- 2009
- [j4]Francisco Guerra Vázquez, Hubertus Th. Jongen, Vladimir Shikhman, Maxim I. Todorov:
Criteria for efficiency in vector optimization. Math. Methods Oper. Res. 70(1): 35-46 (2009) - [j3]Hubertus Th. Jongen, Jan-J. Rückmann, Vladimir Shikhman:
MPCC: Critical Point Theory. SIAM J. Optim. 20(1): 473-484 (2009) - [j2]Hubertus Th. Jongen, Jan-J. Rückmann, Vladimir Shikhman:
On Stability of the Feasible Set of a Mathematical Problem with Complementarity Problems. SIAM J. Optim. 20(3): 1171-1184 (2009) - 2008
- [j1]Vladimir Shikhman:
A note on global optimization via the heat diffusion equation. J. Glob. Optim. 42(4): 619-623 (2008)
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:44 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:
