Buscar
Mostrando ítems 71-80 de 1311
Hypercyclic Convolution Operators On Spaces Of Entire Functions
(Theta FoundationBucharest, 2016)
Minimizações de funções convexas via método de Newton
(Universidade Tecnológica Federal do ParanáCornelio ProcopioBrasilLicenciatura em MatemáticaUTFPR, 2016-06-16)
This work aimd to study nonlinear optimization problems with focus on convex functions minimization. The Convex function definitions, unconstrained minimization problems with the existence of solutions and optimality ...
Jensen's inequality for spectral order and submajorization
(Academic Press Inc Elsevier Science, 2007-07)
Let A be a C*-algebra and φ{symbol} : A → L (H) be a positive unital map. Then, for a convex function f : I → R defined on some open interval and a self-adjoint element a ∈ A whose spectrum lies in I, we obtain a Jensen's-type ...
From error bounds to the complexity of first-order descent methods for convex functions
(2017)
This paper shows that error bounds can be used as effective tools for deriving complexity results for first-order descent methods in convex minimization. In a first stage, this objective led us to revisit the interplay ...
Convex functions and the hadamard inequality
(Universidad Nacuional de Colombia; Sociedad Colombiana de matemáticas, 1994)
The Hadamard inequality is proven without resorting to any properties of the derivative. Only the convexity of the function in a closed interval is needed. Furthermore, if the existence of the integral is assumed, then the ...
Determination of convex functions via subgradients of minimal norm
(Springer, 2020)
We show, in Hilbert space setting, that any two convex proper lower semicontinuous functions bounded from below, for which the norm of their minimal subgradients coincide, they coincide up to a constant. Moreover, under ...
Information, Complexity and Structure in Convex Optimization.
(2015)
This thesis is focused on the limits of performance of large-scale convex optimization algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin in 1983, successfully established the ...
A quadratic convex approximation for optimal operation of battery energy storage systems in DC distribution networks
(Cartagena de Indias, 2021-11-07)
This paper proposes a quadratic convex model for optimal operation of battery energy storage systems in a direct current (DC) network that approximates the original nonlinear non-convex one. The proposed quadratic convex ...
Discrete approximations for strict convex continuous time problems and duality
(Soc Brasileira Matematica Aplicada & Computacional, 2004-01-01)
We propose a discrete approximation scheme to a class of Linear Quadratic Continuous Time Problems. It is shown, under positiveness of the matrix in the integral cost, that optimal solutions of the discrete problems provide ...
Discrete approximations for strict convex continuous time problems and duality
(Soc Brasileira Matematica Aplicada & Computacional, 2004-01-01)
We propose a discrete approximation scheme to a class of Linear Quadratic Continuous Time Problems. It is shown, under positiveness of the matrix in the integral cost, that optimal solutions of the discrete problems provide ...