نتایج جستجو برای: logarithmic quadratic proximal method
تعداد نتایج: 1742714 فیلتر نتایج به سال:
It is argued that the quadratic and linear non-commutative IR divergences that occur in U(1) theory on non-commutative Minkowski spacetime for small non-commutativity matrices θ are gauge-fixing independent. This implies in particular that the perturbative tachyonic instability produced by the quadratic divergences of this type in the vacuum polarization tensor is not a gauge-fixing artifact. S...
This work is motivated by the sign problem in a logarithmic parameter of black hole entropy and existing more massive white dwarfs than Chandrasekhar mass limit. We examine quadratic, linear, linear–quadratic generalized uncertainty principle (GUP) models within virtue recent masses radii dwarfs. consider modification generated introducing minimal length on degenerate Fermi gas equation state (...
Theories from the fields of psychophysics, economics, and organizational behavior are integrated to develop insights about people’s attitudinal reactions to (i.e., the utility and disutility of) pay raises and pay cuts of different sizes. Linear, logarithmic, power, and quadratic functions are developed from this integration. Techniques for evaluating the empirical applicability of these utilit...
This paper describes a regularized variant of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex programs. It is shown that the pointwise iteration-complexity of the new method is better than the corresponding one for the standard ADMM method and that, up to a logarithmic term, is identical to the ergodic iteration-complexity of the latter method. Our...
We give the first algorithm for Matrix Completion that achieves running time and sample complexity that is polynomial in the rank of the unknown target matrix, linear in the dimension of the matrix, and logarithmic in the condition number of the matrix. To the best of our knowledge, all previous algorithms either incurred a quadratic dependence on the condition number of the unknown matrix or a...
in this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the laplacian equation. themethod is based on the use of the galerkin method with cas wavelets constructed on the unit interval as basis.this approach utilizes the non-uniform gauss-legendre quadrature rule for ...
A family of variable metric methods for convex constrained optimization was introduced recently by Birgin, Mart́ınez and Raydan. One of the members of this family is the Inexact Spectral Projected Gradient (ISPG) method for minimization with convex constraints. At each iteration of these methods a strictly convex quadratic function with convex constraints must be (inexactly) minimized. In the ca...
In this paper, a globally convergent Newton-type proximal gradient method is developed for composite multi-objective optimization problems where each objective function can be represented as the sum of smooth and nonsmooth function. The proposed deals with unconstrained convex problems. This free from any kind priori chosen parameters or ordering information functions. At every iteration method...
We present a consolidated manual of Euclidean gravity approaches for finding the logarithmic corrections to entropy full Kerr-Newman family black holes in both extremal and non-extremal limits. Seeley-DeWitt coefficients quadratic fluctuations concern theory appear be key ingredients this manual. Following manual, we calculate first three generalized Einstein-Maxwell minimally-coupled additiona...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید