A constructive and improved version of the proof that there exist a continuous map that solves the convexified problem is presented. A Lipschitz continuous map is analyzed such that a map vector minimizes the functional at each vector satisfying Cellina's condition of existence of minimum. This map is explicitly given by a direct constructive algorithm
We consider the functional∫Ωg(∇u+X∗) dL2nwheregis convex andX∗(x,y)=2(−y,x)and we study the ...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
Abstract. We show that local minimizers of functionals of the form∫ Ω [f(Du(x)) + g(x, u(x))] dx, u ...
Abstract. We study the existence of Lipschitz minimizers of integral functionals I(u) = Ω ϕ(x, detDu...
Summary: The paper offers a technique for the construction of selections in the following problems....
AbstractConsider the Banach space of bounded functions with uniform norm. Given an element ƒ and a c...
In [1], Nesterov has introduced an optimal algorithm with constant step-size, with is th...
The convergence behavior of gradient methods for minimizing convex differentiable functions is one o...
In this paper, we give some convergence results on the gradient projection method with exact stepsiz...
This paper studies a scalar minimization problem with an integral functional of the gradient under a...
none3We show that local minimizers of functionals of the form int_Omega [f(Du(x)) + g(x,u(x))]dx, u...
We give, in a non-smooth setting, some conditions under which (some of) the minimizers of f(Omega) f...
Cornejo, O. Assistant Professor, Departamento de Ingenieria de Sistemas Aplicada, Universidad de Tal...
Let Ω ⊂ ℝn be a bounded Lipschitz domain. Let be a continuous function with superlinear growth at in...
AbstractCharacterizations are given of when the metric projection PM onto a proximal subspace M has ...
We consider the functional∫Ωg(∇u+X∗) dL2nwheregis convex andX∗(x,y)=2(−y,x)and we study the ...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
Abstract. We show that local minimizers of functionals of the form∫ Ω [f(Du(x)) + g(x, u(x))] dx, u ...
Abstract. We study the existence of Lipschitz minimizers of integral functionals I(u) = Ω ϕ(x, detDu...
Summary: The paper offers a technique for the construction of selections in the following problems....
AbstractConsider the Banach space of bounded functions with uniform norm. Given an element ƒ and a c...
In [1], Nesterov has introduced an optimal algorithm with constant step-size, with is th...
The convergence behavior of gradient methods for minimizing convex differentiable functions is one o...
In this paper, we give some convergence results on the gradient projection method with exact stepsiz...
This paper studies a scalar minimization problem with an integral functional of the gradient under a...
none3We show that local minimizers of functionals of the form int_Omega [f(Du(x)) + g(x,u(x))]dx, u...
We give, in a non-smooth setting, some conditions under which (some of) the minimizers of f(Omega) f...
Cornejo, O. Assistant Professor, Departamento de Ingenieria de Sistemas Aplicada, Universidad de Tal...
Let Ω ⊂ ℝn be a bounded Lipschitz domain. Let be a continuous function with superlinear growth at in...
AbstractCharacterizations are given of when the metric projection PM onto a proximal subspace M has ...
We consider the functional∫Ωg(∇u+X∗) dL2nwheregis convex andX∗(x,y)=2(−y,x)and we study the ...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
Abstract. We show that local minimizers of functionals of the form∫ Ω [f(Du(x)) + g(x, u(x))] dx, u ...