default search action
Vera Roshchina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Vinesha Peiris
, Vera Roshchina, Nadezda Sukhorukova:
Artificial neural networks with uniform norm-based loss functions. Adv. Comput. Math. 50(3): 31 (2024) - [j22]Bruno F. Lourenço, Vera Roshchina
Hyperbolicity cones are amenable. Math. Program. 204(1): 753-764 (2024) - [j21]Vera Roshchina, Nadezda Sukhorukova
Uniqueness of solutions in multivariate Chebyshev approximation problems. Optim. Lett. 18(1): 33-55 (2024) - [j20]R. Díaz Millán, Vera Roshchina
Face Relative Interior of Convex Sets in Topological Vector Spaces. SIAM J. Optim. 34(4): 3456-3476 (2024) - 2022
- [j19]Bruno F. Lourenço, Vera Roshchina
Amenable Cones Are Particularly Nice. SIAM J. Optim. 32(3): 2347-2375 (2022) - 2021
- [i2]Vinesha Peiris, Nadezda Sukhorukova, Vera Roshchina:
Deep Learning with Nonsmooth Objectives. CoRR abs/2107.08800 (2021) - 2020
- [j18]Javier Peña
A Data-Independent Distance to Infeasibility for Linear Conic Systems. SIAM J. Optim. 30(2): 1049-1066 (2020)
2010 – 2019
- 2019
- [j17]Hoa T. Bui
Variational Analysis Down Under Open Problem Session. J. Optim. Theory Appl. 182(1): 430-437 (2019) - [j16]Juan Enrique Martínez-Legaz
On the Structure of Higher Order Voronoi Cells. J. Optim. Theory Appl. 183(1): 24-49 (2019) - [j15]Vera Roshchina
The Demyanov-Ryabova conjecture is false. Optim. Lett. 13(1): 227-234 (2019) - [j14]Vera Roshchina
Facially Dual Complete (Nice) Cones and Lexicographic Tangents. SIAM J. Optim. 29(3): 2363-2387 (2019) - 2016
- [j13]Robert Baier, Elza M. Farkhi
From Quasidifferentiable to Directed Subdifferentiable Functions: Exact Calculus Rules. J. Optim. Theory Appl. 171(2): 384-401 (2016) - 2015
- [j12]Kaiwen Meng, Vera Roshchina
On Local Coincidence of a Convex Set and its Tangent Cone. J. Optim. Theory Appl. 164(1): 123-137 (2015) - [j11]Felipe Cucker
Solving second-order conic systems with variable precision. Math. Program. 150(2): 217-250 (2015) - 2014
- [j10]Robert Baier, Elza M. Farkhi
Directed Subdifferentiable Functions and the Directed Subdifferential Without Delta-Convex Structure. J. Optim. Theory Appl. 160(2): 391-414 (2014) - [j9]Irénée Briquel, Felipe Cucker
Fast computation of zeros of polynomial systems with bounded degree under finite-precision. Math. Comput. 83(287): 1279-1317 (2014) - [j8]Javier Peña, Vera Roshchina
Some preconditioners for systems of linear inequalities. Optim. Lett. 8(7): 2145-2152 (2014) - [j7]Vera Roshchina
Facially Exposed Cones Are Not Always Nice. SIAM J. Optim. 24(1): 257-268 (2014) - 2013
- [j6]Javier Peña, Vera Roshchina
A complementarity partition theorem for multifold conic systems. Math. Program. 142(1-2): 579-589 (2013) - 2012
- [j5]Evgeny Lakshtanov
On Finiteness in the Card Game of War. Am. Math. Mon. 119(4): 318-323 (2012) - 2010
- [j4]Vera Roshchina
Mordukhovich subdifferential of pointwise minimum of approximate convex functions. Optim. Methods Softw. 25(1): 129-141 (2010) - [j3]Boris S. Mordukhovich, Javier Peña, Vera Roshchina
Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games. SIAM J. Optim. 20(6): 3490-3511 (2010) - [i1]Evgeny Lakshtanov, Vera Roshchina:
Finiteness in the Card Game of War. CoRR abs/1007.1371 (2010)
2000 – 2009
- 2008
- [j2]Vladimir F. Demyanov
Exhausters, optimality conditions and related problems. J. Glob. Optim. 40(1-3): 71-85 (2008) - [j1]Dong-Hui Li, Liqun Qi
A new class of quasi-Newton updating formulas. Optim. Methods Softw. 23(2): 237-249 (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-11-07 20:32 CET 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: