We provide new sufficient convergence conditions for the convergence of the secant-type methods to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses recurrent functions, and Lipschitz-type and center-Lipschitz-type instead of just Lipschitz-type conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than earlier ones and under our convergence hypotheses we can cover cases where earlier conditions...

We present a convergence analysis of a cell-based finite volume (FV) discretization scheme applied to a problem of control in the coefficients of a generalized Laplace equation modelling, for example, a steady state heat conduction. Such problems arise in applications dealing with geometric optimal design, in particular shape and topology optimization, and are most often solved numerically utilizing a finite element approach. Within the FV framework for control in the coefficients problems ...

We present a convergence analysis of a cell-based finite volume (FV) discretization scheme applied to a problem of control in the coefficients of a generalized Laplace equation modelling, for example, a steady state heat conduction. Such problems arise in applications dealing with geometric optimal design, in particular shape and topology optimization, and are most often solved numerically utilizing a finite element approach. Within the FV framework for control in the coefficients problems ...

A discontinuous Galerkin finite element method for an optimal control problem related to semilinear parabolic PDE's is examined. The schemes under consideration are discontinuous in time but conforming in space. Convergence of discrete schemes of arbitrary order is proven. In addition, the convergence of discontinuous Galerkin approximations of the associated optimality system to the solutions of the continuous optimality system is shown. The proof is based on stability estimates at arbitrary time...

This paper characterizes completely the behavior of the logarithmic barrier method under a standard second order condition, strict (multivalued) complementarity and MFCQ at a local minimizer. We present direct proofs, based on certain key estimates and few well–known facts on linear and parametric programming, in order to verify existence and Lipschitzian convergence of local primal-dual solutions without applying additionally technical tools arising from Newton–techniques.

Convergence results for two Lagrange-Newton-type methods of solving optimal control problems are presented. It is shown how the methods can be applied to a class of optimal control problems for nonlinear ODEs, subject to mixed control-state constraints. The first method reduces to an SQP algorithm. It does not require any information on the structure of the optimal solution. The other one is the shooting method, where information on the structure of the optimal solution is exploited. In each case,...

Many numerical simulations in (bilinear) quantum control use the monotonically convergent Krotov algorithms (introduced by Tannor et al. [Time Dependent Quantum Molecular Dynamics (1992) 347–360]), Zhu and Rabitz [J. Chem. Phys. (1998) 385–391] or their unified form described in Maday and Turinici [J. Chem. Phys. (2003) 8191–8196]. In Maday et al. [Num. Math. (2006) 323–338], a time discretization which preserves the property of monotonicity has been presented. This paper introduces a proof of...

Many inverse problems for differential equations can be formulated as optimal control problems. It is well known that inverse problems often need to be regularized to obtain good approximations. This work presents a systematic method to regularize and to establish error estimates for approximations to some control problems in high dimension, based on symplectic approximation of the Hamiltonian system for the control problem. In particular the work derives error estimates and constructs regularizations...

In this article we modify an iteration process to prove strong convergence and Δ- convergence theorems for a finite family of nonexpansive multivalued mappings in hyperbolic spaces. The results presented here extend some existing results in the literature.

The numerical minimization of the functional $\mathcal{F}\left(u\right)={\int }_{\mathrm{\Omega }}\varphi \left(x,{\nu }_u\right)\left|Du\right|+{\int }_{\partial \mathrm{\Omega }}\mu ud{\mathcal{H}}^{n-1}-{\int }_{\mathrm{\Omega }}\kappa udx$, $u\in BV\left(\mathrm{\Omega };\left\{-1,1\right\}\right)$ is addressed. The function $\varphi$ is continuous, has linear growth, and is convex and positively homogeneous of degree one in the second variable. We prove that $\mathcal{F}$ can be equivalently minimized on the convex set $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ and then regularized with a sequence ${\left\{{\mathcal{F}}_{ϵ}\left(u\right)\right\}}_{ϵ}$, of stricdy convex functionals defined on $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$. Then both $\mathcal{F}$ and ${\mathcal{F}}_{ϵ}$, can be discretized by continuous linear finite elements. The convexity property of the functionals on $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ is useful in the numerical minimization...

We address the numerical minimization of the functional $\mathcal{F}\left(v\right)={\int }_{\mathrm{\Omega }}\left|Dv\right|+{\int }_{\partial \mathrm{\Omega }}\mu vd{\mathcal{H}}^{n-1}-{\int }_{\mathrm{\Omega }}xvdx$, for $v\in BV\left(\mathrm{\Omega };\left\{-1,1\right\}\right)$. We note that $\mathcal{F}$ can be equivalently minimized on the larger, convex, set $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ and that, on that space, $\mathcal{F}$ may be regularized with a sequence $\mathit{\left\{}\mathcal{F}{}_{ϵ}\right(v)=\int {}_{\mathrm{\Omega }}\sqrt{{ϵ}^2+{\left|Dv\right|}^2}+\int {}_{\partial \mathrm{\Omega }}\mu vd\mathcal{H}{}^{n-1}-\int {}_{\mathrm{\Omega }}xvdx\mathit{\}}{}_{ϵ}$of regular functionals. Then both $\mathcal{F}$ and ${\mathcal{F}}_{ϵ}$ can be discretized by continuous linear finite elements. The convexity of the functionals in $BV\left(\mathrm{\Omega };\left[-1,1\right]\right)$ is useful for the numerical minimization of $\mathcal{F}$. We prove the $\mathrm{\Gamma }-L^1\left(\mathrm{\Omega }\right)$-convergence of the discrete functionals to $\mathcal{F}$ and present a few numerical examples.

We investigate the minimum time transfer of a satellite around the Earth. Using an optimal control model, we study the controllability of the system and propose a geometrical analysis of the optimal command structure. Furthermore, in order to solve the problem numerically, a new parametric technique is introduced for which convergence properties are established.

We investigate the minimum time transfer of a satellite around the Earth. Using an optimal control model, we study the controllability of the system and propose a geometrical analysis of the optimal command structure. Furthermore, in order to solve the problem numerically, a new parametric technique is introduced for which convergence properties are established.