Pàgina inicial > Resultats de la cerca: Convex inequalities
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 4 registres trobats en 0.03 segons.
Articles, 4 registres trobats
Articles 4 registres trobats  
1.
39 p, 451.5 KB Isosystolic inequalities for optical hypersurfaces / Alvarez Paiva, Juan Carlos (Université de Lille. Laboratoire Paul Painlevé) ; Balacheff, Florent Nicolas (Université de Lille. Laboratoire Paul Painlevé) ; Tzanev, Kroum (Université de Lille. Laboratoire Paul Painlevé)
We explore a natural generalization of systolic geometry to Finsler metrics and optical hypersurfaces with special emphasis on its relation to the Mahler conjecture and the geometry of numbers. In particular, we show that if an optical hypersurface of contact type in the cotangent bundle of the 2-dimensional torus encloses a volume V, then it carries a periodic characteristic whose action is at most V/3. [...]
2016 - 10.1016/j.aim.2016.07.003
Advances in mathematics, Vol. 301 (October 2016) , p. 934-972  
Registre complet - Creative Commons
2.
19 p, 403.2 KB On Bregman-type distances for convex functions and maximally monotone operators / Burachik, Regina (University of South Australia. School of Information Technology and Mathematical Sciences) ; Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica)
Given two point to set operators, one of which is maximally monotone, we introduce a new distance in their graphs. This new concept reduces to the classical Bregman distance when both operators are the gradient of a convex function. [...]
2018 - 10.1007/s11228-017-0443-6
Set-Valued and Variational Analysis, Vol. 26, Núm. 2 (2018) , p. 369-384  
Registre complet -
3.
8 p, 284.6 KB Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification / Mangasarian, O. L.
A global error bound is given on the distance between an arbitrary point in the n-dimensional real space R^n and its projection on a nonempty convex set determined by m convex, possibly nondifferentiable, inequalities. [...]
1998
Mathematical Programming, vol. 83 n. 2 (1998) p. 187-194  
 Accés restringit a la UAB
Registre complet -
4.
13 p, 621.7 KB Equilibrium programming using proximal-like algorithms / Flå, Sjur Didrik ; Antipin, Anatoly S.
We compute constrained equilibria satisfying an optimality condition. Important examples include convex programming, saddle problems, noncooperative games, and variational inequalities. Under a monotonicity hypothesis we show that equilibrium solutions can be found via iterative convex minimization. [...]
1997
Mathematical Programming, vol. 78 n. 1 (1997) p. 29-41  
 Accés restringit a la UAB
Registre complet -

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.
Dipòsit Digital de Documents de la UAB :: Cerca :: Lliura :: Personalitza :: Ajuda
Powered by Invenio v1.1.6
Mantingut per ddd.bib@uab.cat  :: Metadades subjectes a:
Col·laborem