Página principal > Resultados de la búsqueda: Variational inequalities
  Consejos para la búsqueda
Búsqueda avanzada
Buscar colecciones:
Ordenar por: Mostrar resultados: Formato de visualización:
Resultados globales: 5 registros encontrados en 0.02 segundos.
Artículos, Encontrados 5 registros
Artículos Encontrados 5 registros  
1.
28 p, 460.9 KB Rescaled extrapolation for vector-valued functions / Amenta, Alex (Delft Institute of Applied Mathematics (Delft, Països Baixos)) ; Lorist, Emiel (Delft Institute of Applied Mathematics (Delft, Països Baixos)) ; Veraar, Mark (Delft Institute of Applied Mathematics (Delft, Països Baixos))
We extend Rubio de Francia's extrapolation theorem for functions valued in UMD Banach function spaces, leading to short proofs of some new and known results. In particular we prove Littlewood-Paley-Rubio de Francia-type estimates and boundedness of variational Carleson operators for Banach function spaces with UMD concavifications.
2019 - 10.5565/PUBLMAT6311905
Publicacions matemàtiques, Vol. 63 Núm. 1 (2019) , p. 155-182 (Articles)  
Registro completo -
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  
Registro completo -
3.
34 p, 2.0 MB Error bounds in mathematical programming / Pang, Jong-Shi
Originated from the practical implementation and numerical considerations of iterative methods for solving mathematical programs, the study of error bounds has grown and proliferated in many interesting areas within mathematical programming. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 299-332  
 Acceso restringido a la UAB
Registro completo -
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  
 Acceso restringido a la UAB
Registro completo -
5.
30 p, 1.4 MB QPCOMP : A quadratic programming based solver for mixed complementarity problems / Billups, Stephen C. ; Ferris, Michael C.
QPCOMP is an extremely robust algorithm for solving mixed nonlinear complementarity problems that has fast local convergence behavior. Based in part on the NE/SQP method of Pang and Gabriel, this algorithm represents a significant advance in robustness at no cost in efficiency. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 533-562  
 Acceso restringido a la UAB
Registro completo -

¿Le interesa recibir alertas sobre nuevos resultados de esta búsqueda?
Defina una alerta personal vía correo electrónico o subscríbase al canal RSS.
Depósito Digital de Documentos de la UAB :: Buscar :: Enviar :: Personalizar :: Ayuda
Powered by Invenio v1.1.6
Mantenido por ddd.bib@uab.cat  :: Metadatos sujetos a:
Colaboramos