Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Vera Roshchina"'
Autor:
R. Díaz Millán, Vera Roshchina
Publikováno v:
Set-Valued and Variational Analysis. 31
Autor:
Vera Roshchina, Alexander Plakhov
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Submitted by Alexandre Plakhov (plakhov@ua.pt) on 2019-05-05T10:48:56Z No. of bitstreams: 1 ImpInf04.pdf: 180557 bytes, checksum: 33a9395f4df2d445720e1248ccbee428 (MD5) Approved for entry into archive by Diana Silva (dianasilva@ua.pt) on 2019-05-06T1
Amenability is a notion of facial exposedness for convex cones that is stronger than being facially dual complete (or "nice") which is, in turn, stronger than merely being facially exposed. Hyperbolicity cones are a family of algebraically structured
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ef0a130b55c2fec04ea11cb9c0fb9ba
Amenability is a geometric property of convex cones that is stronger than facial exposedness and assists in the study of error bounds for conic feasibility problems. In this paper we establish numerous properties of amenable cones, and investigate th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edf9888fccf38430a9baea74f57b740f
http://arxiv.org/abs/2011.07745
http://arxiv.org/abs/2011.07745
Publikováno v:
Journal of Optimization Theory and Applications. 182:430-437
We state the problems discussed in the open problem session at Variational Analysis Down Under conference held in honour of Prof. Asen Dontchev on 19–21 February 2018 at Federation University Australia.
Autor:
Vera Roshchina
Publikováno v:
Optimization Letters. 13:227-234
It was conjectured by Demyanov and Ryabova (Discrete Contin Dyn Syst 31(4):1273–1292, 2011) that the minimal cycle in the sequence obtained via repeated application of the Demyanov converter to a finite family of polytopes is at most two. We constr
Publikováno v:
Optimization. 68:3-12
The convex feasibility problem consists in finding a point in the intersection of a finite family of closed convex sets. When the intersection is empty, a best compromise is to search for a point t...
Publikováno v:
Optimization. 68:1391-1409
We generalize the outer subdifferential construction suggested by Canovas, Henrion, Lopez and Parra for max type functions to pointwise minima of regular Lipschitz functions. We also answer an open question about the relation between the outer subdif
Autor:
Javier Peña, Vera Roshchina
We offer a unified treatment of distinct measures of well-posedness for homogeneous conic systems. To that end, we introduce a distance to infeasibility based entirely on geometric considerations of the elements defining the conic system. Our approac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5344809b32a638961b57b9ec2c3e955b
http://arxiv.org/abs/1805.09494
http://arxiv.org/abs/1805.09494