For the minimization of a nonlinear cost functional under convex constraints the relaxed projected gradient process is a well known method. The analysis is classically performed in a Hilbert space. We generalize this method to functionals which are differentiable in a Banach space. The search direction is calculated by a quadratic approximation of the cost functional using the idea of the projected gradient. Thus it is possible to perform, e.g., an L-2 gradient method if the cost functional is only differentiable in L-infinity. We show global convergence using Armijo backtracking for the step length selection and allow the underlying inner product and the scaling of the derivative to change in every iteration. As an application we present a...
This paper is concerned with optimization or minimization problems that are governed by operator equ...
peer reviewedSpatial gradient information of density field in SIMP (Solid Isotropic Material with Pe...
Abstract Convergence analysis is carried out for a forward-backward splitting/ generalized gradient ...
Abstract For the minimization of a nonlinear cost functional j under convex constraints the relaxed ...
For the minimization of a nonlinear cost functional j under convex constraints the relaxed projected...
This thesis proposes a generalization of the projected gradient method with variable metric to an ab...
This paper proposes an efficient and reliable topology optimization method that can obtain a black a...
The gradient projection algorithm plays an important role in solving constrained convex minimization...
We consider the problem of minimizing a Lipschitz differentiable function over a class of sparse sym...
. We describe an algorithm for optimization of a smooth function subject to general linear constrain...
We develop a unified framework for convergence analysis of subgradient and subgradient projection me...
© 2017 Informa UK Limited, trading as Taylor & Francis Group We suggest simple implementable modif...
Projected gradient descent denotes a class of iterative methods for solving optimization programs. I...
Abstract in UndeterminedThe topology optimization problem is formulated in a phase-field approach. T...
The topology optimization problem is formulated in a phase-field approach. The solution procedure is...
This paper is concerned with optimization or minimization problems that are governed by operator equ...
peer reviewedSpatial gradient information of density field in SIMP (Solid Isotropic Material with Pe...
Abstract Convergence analysis is carried out for a forward-backward splitting/ generalized gradient ...
Abstract For the minimization of a nonlinear cost functional j under convex constraints the relaxed ...
For the minimization of a nonlinear cost functional j under convex constraints the relaxed projected...
This thesis proposes a generalization of the projected gradient method with variable metric to an ab...
This paper proposes an efficient and reliable topology optimization method that can obtain a black a...
The gradient projection algorithm plays an important role in solving constrained convex minimization...
We consider the problem of minimizing a Lipschitz differentiable function over a class of sparse sym...
. We describe an algorithm for optimization of a smooth function subject to general linear constrain...
We develop a unified framework for convergence analysis of subgradient and subgradient projection me...
© 2017 Informa UK Limited, trading as Taylor & Francis Group We suggest simple implementable modif...
Projected gradient descent denotes a class of iterative methods for solving optimization programs. I...
Abstract in UndeterminedThe topology optimization problem is formulated in a phase-field approach. T...
The topology optimization problem is formulated in a phase-field approach. The solution procedure is...
This paper is concerned with optimization or minimization problems that are governed by operator equ...
peer reviewedSpatial gradient information of density field in SIMP (Solid Isotropic Material with Pe...
Abstract Convergence analysis is carried out for a forward-backward splitting/ generalized gradient ...