5 research outputs found
Sufficient conditions for time optimality of systems with control on the disk
International audienceThe case of time minimization for affine control systems with control on the disk is studied. After recalling the standard sufficient conditions for local optimality in the smooth case, the analysis focusses on the specific type of singularities encountered when the control is prescribed to the disk. Using a suitable stratification, the regularity of the flow is analyzed, which helps to devise verifiable sufficient conditions in terms of left and right limits of Jacobi fields at a switching point. Under the appropriate assumptions, piecewise regularity of the field of extremals is obtained
Further Application of H
We study nonsmooth generalized complementarity problems based on the generalized Fisher-Burmeister function and its generalizations, denoted by GCP(f,g) where f and g are H-differentiable. We describe H-differentials of some GCP functions based on the generalized Fisher-Burmeister function and its generalizations, and their merit functions. Under appropriate conditions on the H-differentials of f and g, we show that a local/global minimum of a merit function (or a “stationary point” of a merit function) is coincident with the solution of the given generalized complementarity problem. When specializing GCP(f,g) to the nonlinear complementarity problems, our results not only give new results but also extend/unify various similar results proved for C1, semismooth, and locally Lipschitzian
Forward-backward truncated Newton methods for convex composite optimization
This paper proposes two proximal Newton-CG methods for convex nonsmooth
optimization problems in composite form. The algorithms are based on a a
reformulation of the original nonsmooth problem as the unconstrained
minimization of a continuously differentiable function, namely the
forward-backward envelope (FBE). The first algorithm is based on a standard
line search strategy, whereas the second one combines the global efficiency
estimates of the corresponding first-order methods, while achieving fast
asymptotic convergence rates. Furthermore, they are computationally attractive
since each Newton iteration requires the approximate solution of a linear
system of usually small dimension
On the superlinear convergence in computational elasto-plasticity
We develop a general convergence analysis for a class of inexact Newton-type regularizations for stably solving nonlinear ill-posed problems. Each of the methods under consideration consists of two components: the outer Newton iteration and an inner regularization scheme which, applied to the linearized system, provides the update. In this paper we give a novel and unified convergence analysis which is not confined to a specific inner regularization scheme but applies to a multitude of schemes including Landweber and steepest decent iterations, iterated Tikhonov method, and method of conjugate gradients
On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives
The paper deals with a comprehensive theory of mappings, whose local behavior
can be described by means of linear subspaces, contained in the graphs of two
(primal and dual) generalized derivatives. This class of mappings includes the
graphically Lipschitzian mappings and thus a number of multifunctions,
frequently arising in optimization and equilibrium problems. The developed
theory makes use of own generalized derivatives, provides us with some calculus
rules and reveals a number of interesting connections. In particular, it
enables us to construct a modification of the semismooth* Newton method with
improved convergence properties and to derive a generalization of Clarke's
Inverse Function Theorem to multifunctions together with new efficient
characterizations of strong metric (sub)regularity and tilt stability