**Abstract**: We propose a second-order total generalized variation (TGV) regularization for the reconstruction of the initial condition in variational data assimilation problems. After showing the equivalence between TGV regularization and a Bayesian MAP estimator, we focus on the detailed study of the inviscid Burgers' data assimilation problem. Due to the difficult structure of the governing hyperbolic conservation law, we consider a discretize–then–optimize approach and rigorously derive a first-order optimality condition for the problem. For the numerical solution, we propose a globalized reduced Newton-type method together with a polynomial line-search strategy, and prove convergence of the algorithm to stationary points. The paper finishes with some numerical experiments where, among others, the performance of TGV–regularization compared to TV–regularization is tested.

**Abstract**: The primal-dual hybrid gradient method, modified (PDHGM, also known as the Chambolle{Pock method), has proved very successful for convex optimization problems involving linear operators arising in image processing and inverse problems. In this paper, we analyze an extension to nonconvex problems that arise if the operator is nonlinear. Based on the idea of testing, we derive new step-length parameter conditions for the convergence in infinite-dimensional Hilbert spaces and provide acceleration rules for suitably (locally and/or partially) monotone problems. Importantly, we prove linear convergence rates as well as global convergence in certain cases. We demonstrate the efficacy of these step-length rules for PDE-constrained optimization problems.

**Abstract**: We study and develop (stochastic) primal-dual block-coordinate descent methods for convex problems based on the method due to Chambolle and Pock. Our methods have known convergence rates for the iterates and the ergodic gap of $O(1/N^2)$ if each block is strongly convex, $O(1/N)$ if no convexity is present, and more generally a mixed rate $O(1/N2) + O(1/N)$ for strongly convex blocks if only some blocks are strongly convex. Additional novelties of our methods include blockwise-adapted step lengths and acceleration as well as the ability to update both the primal and dual variables randomly in blocks under a very light compatibility condition. In other words, these variants of our methods are doubly-stochastic. We test the proposed methods on various image processing problems, where we employ pixelwise-adapted acceleration.

**Abstract**: Employing the ideas of non-linear preconditioning and testing of the classical proximal point method, we formalise common arguments in convergence rate and convergence proofs of optimisation methods to the verification of a simple iteration-wise inequality. When applied to fixed point operators, the latter can be seen as a generalisation of firm non-expansivity or the $\alpha$-averaged property. The main purpose of this work is to provide the abstract background theory for our companion paper “Block-proximal methods with spatially adapted acceleration”. In the present account we demonstrate the effectiveness of the general approach on several classical algorithms, as well as their stochastic variants. Besides, of course, the proximal point method, these method include the gradient descent, forward–backward splitting, Douglas–Rachford splitting, Newton’s method, as well as several methods for saddle-point problems, such as the Alternating Directions Method of Multipliers, and the Chambolle–Pock method.

**Abstract**: Variational inequalities are an important mathematical tool for modelling free boundary problems that arise in different application areas. Due to the intricate nonsmooth structure of the resulting models, their analysis and optimization is a difficult task that has drawn the attention of researchers for several decades. In this paper we focus on a class of variational inequalities, called of the second kind, with a twofold purpose. First, we aim at giving a glance at some of the most prominent applications of these types of variational inequalities in mechanics, and the related analytical and numerical difficulties. Second, we consider optimal control problems constrained by these variational inequalities and provide a thorough discussion on the existence of Lagrange multipliers and the different types of optimality systems that can be derived for the characterization of local minima. The article ends with a discussion of the main challenges and future perspectives of this important problem class.

**Abstract**: Fractional differential equations are becoming increasingly popular as a modeling tool to describe a wide range of non-classical phenomena with spatial heterogeneities throughout the applied science and engineering. A recently developed nonlocal vector calculus is exploited to provide a variational analysis for a general class of nonlocal operators which include fractional Laplacians on bounded domains in $\mathbb{R}^n$. We develop the Galerkin method to prove existence and uniqueness of weak solutions to nonlocal parabolic problems. Moreover, we study the existence of orthonormal basis of eigenvectors associated to these nonlocal operators.

**Abstract**: In this work a balanced $k$-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total distance of the road trips that all teams must travel to play a double round robin tournament in each group is minimized. Two integer programming formulations for this problem are introduced, and the validity of three families of inequalities associated to the polytope of these formulations is proved. The performance of a tabu search procedure and a branch and cut algorithm, which uses the valid inequalities as cuts, is evaluated over simulated and real-world instances. In particular, an optimal solution for the realignment of the Ecuadorian football league is reported and the methodology can be suitable adapted for the realignment of other sports leagues.

**Abstract**: A global atlas of ocean wave spectra is developed and presented. The development is based on a new technique for deriving wave spectral statistics, which is applied to the extensive ERA-Interim database from European Centre of Medium-Range Weather Forecasts. Spectral statistics is based on the idea of long-term wave systems, which are unique and distinct at every geographical point. The identification of those wave systems allows their separation from the overall spectrum using the partition technique. Their further characterization is made using standard integrated parameters, which turn out much more meaningful when applied to the individual components than to the total spectrum. The parameters developed include the density distribution of spectral partitions, which is the main descriptor; the identified wave systems; the individual distribution of the characteristic frequencies, directions, wave height, wave age, seasonal variability of wind and waves; return periods derived from extreme value analysis; and crossing-sea probabilities. This information is made available in web format for public use at http://www.modemat.epn.edu.ec/#/nereo. It is found that wave spectral statistics offers the possibility to synthesize data while providing a direct and comprehensive view of the local and regional wave conditions.

**Abstract**: In this paper we propose a multigrid optimization algorithm (MG/OPT) for the numerical solution of a class of quasilinear variational inequalities of the second kind. This approach is enabled by the fact that the solution of the variational inequality is given by the minimizer of a nonsmooth energy functional, involving the pp-Laplace operator. We propose a Huber regularization of the functional and a finite element discretization for the problem. Further, we analyze the regularity of the discretized energy functional, and we are able to prove that its Jacobian is slantly differentiable. This regularity property is useful to analyze the convergence of the MG/OPT algorithm. In fact, we demonstrate that the algorithm is globally convergent by using a mean value theorem for semismooth functions. Finally, we apply the MG/OPT algorithm to the numerical simulation of the viscoplastic flow of Bingham, Casson and Herschel–Bulkley fluids in a pipe. Several experiments are carried out to show the efficiency of the proposed algorithm when solving this kind of fluid mechanics problems.

**Abstract**: In this paper we are interested in comparing the performance of some of the most relevant first order non-smooth optimization methods applied to the Rudin, Osher and Fatemi (ROF) Image Denoising Model and a Primal-Dual Chambolle-Pock Image Denoising Model. Because of the properties of the resulting numerical schemes it is possible to handle these computations pixelwise, allowing implementations based on parallel paradigms which are helpful in the context of high resolution imaging.

**Abstract**: In this paper, we deal with a new class of non-local operators that we term integro-differential systems of mixed type. We study the behaviour of solutions of this system when the diffusion term involves higher order fractional powers of the Laplacian. Moreover, we prove that the solution of the system decays faster than a power with an exponent given by the smallest index of the fractional power of the Laplacian.

**Abstract**: We consider the problem of image denoising in the presence of noise whose statistical properties are a combination of two different distributions. We focus on noise distributions frequently considered in applications, such as salt & pepper and Gaussian, and Gaussian and Poisson noise mixtures. We derive a variational image denoising model that features a total variation regularization term and a data discrepancy encoding the mixed noise as an infimal convolution of discrepancy terms of the single-noise distributions. We give a statistical derivation of this model by joint maximum a posteriori (MAP) estimation. Classical single-noise models are recovered asymptotically as the weighting parameters go to infinity. The numerical solution of the model is computed using second order Newton-type methods. Numerical results show the decomposition of the noise into its constituting components. The paper is furnished with several numerical experiments, and comparisons with other methods dealing with the mixed noise case are shown.

**Abstract**: We consider a bilevel optimization approach in function space for the choice of spatially dependent regularization parameters in TV image denoising models. First- and second-order optimality conditions for the bilevel problem are studied when the spatially-dependent parameter belongs to the Sobolev space ${{H}^{1}}\left(\Omega \right)$ . A combined Schwarz domain decomposition-semismooth Newton method is proposed for the solution of the full optimality system and local superlinear convergence of the semismooth Newton method is verified. Exhaustive numerical computations are finally carried out to show the suitability of the approach.

**Abstract**: We review some recent learning approaches in variational imaging, based on bilevel optimisation, and emphasize the importance of their treatment in function space. The paper covers both analytical and numerical techniques. Analytically, we include results on the existence and structure of minimisers, as well as optimality conditions for their characterisation. Based on this information, Newton type methods are studied for the solution of the problems at hand, combining them with sampling techniques in case of large databases. The computational verification of the developed techniques is extensively documented, covering instances with different type of regularisers, several noise models, spatially dependent weights and large image databases.

**Abstract**: In this paper we are interested in the well-posedness of fully nonlinear Cauchy problems in which the time derivative is of Caputo type. We address this question in the framework of viscositysolutions, obtain-ing the existence via Perron’s method, and comparison for bounded sub and supersolutions by a suitable regularization through inf and sup convolution in time. As an application, we prove the steady-state large time behavior in the case of proper nonlinearities and provide a rate of convergence by using the Mittag–Leffler operator.

**Abstract**: We present a second order algorithm, based on orthantwise directions, for solving optimization problems involving the sparsity enhancing $\ell_1$-norm. The main idea of our method consists in modifying the descent orthantwise directions by using second order information both of the regular term and (in weak sense) of the $\ell_1$-norm. The weak second order information behind the $\ell_1$-term is incorporated via a partial Huber regularization. One of the main features of our algorithm consists in a faster identification of the active set. We also prove that a reduced version of our method is equivalent to a semismooth Newton algorithm applied to the optimality condition, under a specific choice of the algorithm parameters. We present several computational experiments to show the efficiency of our approach compared to other state-of-the-art algorithms.

**Abstract**: This paper is concerned with the numerical solution of a class of variational inequalities of the second kind, involving the p-Laplacian operator. This kind of problems arise, for instance, in the mathematical modelling of non-Newtonian fluids. We study these problems by using a regularization approach, based on a Huber smoothing process. Well posedness of the regularized problems is proved, and convergence of the regularized solutions to the solution of the original problem is verified. We propose a preconditioned descent method for the numerical solution of these problems and analyze the convergence of this method in function spaces. The existence of admissible descent directions is established by variational methods and admissible steps are obtained by a backtracking algorithm which approximates the objective functional by polynomial models. Finally, several numerical experiments are carried out to show the efficiency of the methodology here introduced.

**Abstract**: The fact that ocean surface waves are an integrated effect of meteorological activity has the interesting consequence that the memory of the wave systems is larger than that of the wind and storms that generated them. At each single point the related information is stored as its wave spectrum, a matrix containing the energy distribution of wave systems with different origins in space and time. We describe the concept of spectral partitioning and the technique used to obtain spectral statistics, whose outcome we associate with the physical reality. Using long series of spectral data we derive information of the, possibly very far, generation zones climatologically connected at a confluent point. Working on the eastern equatorial Pacific we focus on the prominent effects of El Niño events, for which interactions of mesoscale phenomena are revealed from the analysis of the local situation.

**Abstract**: An optimal control problem of static plasticity with linear kinematic hardening and von Mises yield condition is studied. The problem is treated in its primal formulation, where the state system is a variational inequality of the second kind. First-order necessary optimality conditions are obtained by means of an approximation by a family of control problems with state system regularized by Huber-type smoothing, and a subsequent limit analysis. The equivalence of the optimality conditions with the C-stationarity system for the equivalent dual formulation of the problem is proved. Numerical experiments are presented, which demonstrate the viability of the Huber-type smoothing approach.

**Abstract**: The aim of this paper is to study the time asymptotic propagation for mild solutions to the fractional reaction diffusion cooperative systems when at least one entry of the initial condition decays slower than a power. We state that the solution spreads at least exponentially fast with an exponent depending on the diffusion term and on the smallest index of fractional Laplacians.

**Abstract**: The aim of this paper is to study the large-time behaviour of mild solutions to the one-dimensional cooperative systems with anomalous diffusion when at least one entry of the initial condition decays slower than a power. We prove that the solution moves at least exponentially fast as time goes to infinity. Moreover, the exponent of propagation depends on the decay of the initial condition and of the reaction term.

**Abstract**: In the second category of the Ecuadorian football league, a set of football teams must be grouped into $k$ geographical zones according to some regulations, where the total distance of the road trips that all teams must travel to play a Double Round Robin Tournament in each zone is minimized. This problem can be modeled as a $k$-clique partitioning problem with constraints on the sizes and weights of the cliques. An integer programming formulation and a heuristic approach were developed to provide a solution to the problem which has been implemented in the 2015 edition of the aforementioned football championship.

**Abstract**: We consider a bilevel optimisation approach for parameter learning in higher-order total variation image reconstruction models. Apart from the least squares cost functional, naturally used in bilevel learning, we propose and analyse an alternative cost based on a Huber-regularised TV seminorm. Differentiability properties of the solution operator are verified and a first-order optimality system is derived. Based on the adjoint information, a combined quasi-Newton/semismooth Newton algorithm is proposed for the numerical solution of the bilevel problems. Numerical experiments are carried out to show the suitability of our approach and the improved performance of the new cost functional. Thanks to the bilevel optimisation framework, also a detailed comparison between $TGV^2$ and $ICTV$ is carried out, showing the advantages and shortcomings of both regularisers, depending on the structure of the processed images and their noise level.

**Abstract**: In this paper, a new methodology is proposed for the computation of Background Errors in wave data assimilation systems. Background errors define the spatial influence of an observation in the model domain. Since at present the directional wave spectrum is the fundamental variable of both state-ofthe- art numerical models and most modern instrumentation, this is at the core of the proposed methodology. The advantage of the spectral approach is that the wave spectrum contains detailed information of the different wave systems and physical processes at work (e.g., wind-sea or swells). These systems have different origins and may be driven by different mechanisms, having therefore different spatial structures, length scales, and sensitivity to local wind conditions. The presented method enables making consistent and specific corrections to each component of the spectrum, in time and space. The innovations presented here require an integral look at the data assimilation algorithm for which a suitable scheme is also proposed. Examples of computed background errors are presented for shelf and oceanic basins showing the spatial structures of the different wave systems active in these areas.

**Abstract**: Row family inequalities defined in [Argiroffo, G. and S. Bianchi, Row family inequalities for the set covering polyhedron, Electronic Notes in Discrete Mathematics 36 (2010), pp. 1169–1176] are revisited in the context of the set covering polyhedron of circulant matrices $Q^*(C_n^k)$. A subclass of these inequalities, together with boolean facets, provides a complete linear description of $Q^*(C_n^k)$. The relationship between row family inequalities and minor inequalities is further studied.

**Abstract**: Recently, nonconvex regularization models have been introduced in order to provide a better prior for gradient distributions in real images. They are based on using concave energies $\phi$ in the total variation--type functional ${TV}^\phi(u) := \int \phi(|\nabla u(x)|)\,d x$. In this paper, it is demonstrated that for typical choices of $\phi$, functionals of this type pose several difficulties when extended to the entire space of functions of bounded variation, ${BV}(\Omega)$. In particular, if $\phi(t)=t^q$ for $q \in (0, 1)$, and ${TV}^\phi$ is defined directly for piecewise constant functions and extended via weak* lower semicontinuous envelopes to ${BV}(\Omega)$, then it still holds that ${TV}^\phi(u)=\infty$ for $u$ not piecewise constant. If, on the other hand, ${TV}^\phi$ is defined analogously via continuously differentiable functions, then ${TV}^\phi \equiv 0$ (!). We study a way to remedy the models through additional multiscale regularization and area strict convergence, provided that the energy $\phi(t)=t^q$ is linearized for high values. The fact that such energies actually better match reality and improve reconstructions is demonstrated by statistics and numerical experiments.

**Abstract**: We derive a-priori error estimates for the finite-element approximation of a distributed optimal control problem governed by the steady one-dimensional Burgers equation with pointwise box constraints on the control. Here the approximation of the state and the control is done by using piecewise linear functions. With this choice, a superlinear order of convergence for the control is obtained in the L2-norm; moreover, under a further assumption on the regularity structure of the optimal control this error estimate can be improved to h3/2, extending the results in Rösch (Optim. Methods Softw. 21(1): 121–134, 2006). The theoretical findings are tested experimentally by means of numerical examples.

**Abstract**: This paper is concerned with an optimal control problem of steady-state electrorheological fluids based on an extended Bingham model. Our control parameters are given by finite real numbers representing applied direct voltages, which enter in the viscosity of the electrorheological fluid via an electrostatic potential. The corresponding optimization problem belongs to a class of nonlinear optimal control problems of variational inequalities with control in the coefficients. We analyze the associated variational inequality model and the optimal control problem. Thereafter, we introduce a family of Huber-regularized optimal control problems for the approximation of the original one and verify the convergence of the regularized solutions. Differentiability of the solution operator is proved and an optimality system for each regularized problem is established. In the last part of the paper, an algorithm for the numerical solution of the regularized problem is constructed and numerical experiments are carried out.

**Abstract**: We study the qualitative properties of optimal regularisation parameters in variational models for image restoration. The parameters are solutions of bilevel optimisation problems with the image restoration problem as constraint. A general type of regulariser is considered, which encompasses total variation (TV), total generalised variation (TGV) and infimal-convolution total variation (ICTV). We prove that under certain conditions on the given data optimal parameters derived by bilevel optimisation problems exist. A crucial point in the existence proof turns out to be the boundedness of the optimal parameters away from 0 which we prove in this paper. The analysis is done on the original – in image restoration typically non-smooth variational problem – as well as on a smoothed approximation set in Hilbert space which is the one considered in numerical computations. For the smoothed bilevel problem we also prove that it $\Gamma$ converges to the original problem as the smoothing vanishes. All analysis is done in function spaces rather than on the discretised learning problem.

**Abstract**: An accurate and fast solution scheme for parabolic bilinear optimization problems is presented. Parabolic models where the control plays the role of a reaction coefficient and the objective is to track a desired trajectory are formulated and investigated. Existence and uniqueness of optimal solution are proved. A space-time discretization is proposed and second-order accuracy for the optimal solution is discussed. The resulting optimality system is solved with a nonlinear multigrid strategy that uses a local semismooth Newton step as smoothing scheme. Results of numerical experiments validate the theoretical accuracy estimates and demonstrate the ability of the multigrid scheme to solve the given optimization problems with mesh-independent efficiency.

**Abstract**: A new method is presented for a physically based statistical description of wind wave climatology. The method applies spectral partitioning to identify individual wave systems (partitions) in time series of 2D-wave spectra, followed by computing the probability of occurrence of their (peak) position in frequency–direction space. This distribution can be considered as a spectral density function to which another round of partitioning is applied to obtain spectral domains, each representing a typical wave system or population in a statistical sense. This two-step partitioning procedure allows identifying aggregate wave systems without the need to discuss specific characteristics as wind sea and swell systems. We suggest that each of these aggregate wave systems (populations) is linked to a specific generation pattern opening the way to dedicated analyses. Each population (of partitions) can be subjected to further analyses to add dimension carrying information based on integrated wave parameters of each partition, such as significant wave height, wave age, mean wave period and direction, among others. The new method is illustrated by analysing model spectra from a numerical wave prediction model and measured spectra from a directional wave buoy located in the Southern North Sea. It is shown that these two sources of information yield consistent results. Examples are given of computing the statistical distribution of significant wave height, spectral energy distribution and the spatial variation of wind wave characteristics along a north–south transect in the North Sea. Wind or wave age information can be included as an extra attribute of the members of a population to label them as wind sea or swell systems. Finally, suggestions are given for further applications of this new method.

**Abstract**: We consider optimal control problems of quasilinear elliptic equations with gradient coefficients arising in variable viscosity fluid flow. The state equation is monotone and the controls are of distributed type. We prove that the control-to-state operator is twice Fréchet differentiable for this class of equations. A finite element approximation is studied and an estimate of optimal order h is obtained for the control. The result makes use of the distributed structure of the controls, together with a regularity estimate for elliptic equations with Hölder coefficients and a second order sufficient optimality condition. The paper ends with a numerical experiment, where the approximation order is computationally tested.

**Abstract**: We present a model for the dynamics of discrete deterministic systems, based on an extension of the Petri net framework. Our model relies on the definition of a priority relation between conflicting transitions, which is encoded in a compact manner by orienting the edges of a transition conflict graph. The benefit is that this allows the use of a successor oracle for the study of dynamic processes from a global point of view, independent from a particular initial state and the (complete) construction of the reachability graph. We provide a characterization, in terms of a local consistency condition, of those deterministic systems whose dynamic behavior can be encoded using our approach and consider the problem of recognizing when an orientation of the transition conflict graph is valid for this purpose . Finally, we address the problem of gaining the information that allows to provide an appropriate priority relation gouverning the dynamic behavior of the studied system and dicuss some further implications and generalizations of the studied approach.

**Abstract**: We discuss numerical reduction methods for an optimal control problem of semi-infinite type with finitely many control parameters but infinitely many constraints. We invoke known a priori error estimates to reduce the number of constraints. In a first strategy, we apply uniformly refined meshes, whereas in a second more heuristic strategy we use adaptive mesh refinement and provide an a posteriori error estimate for the control based on perturbation arguments.

**Abstract**: We investigate optimality conditions for optimization problems constrained by a class of variational inequalities of the second kind. Based on a nonsmooth primal–dual reformulation of the governing inequality, the differentiability of the solution map is studied. Directional differentiability is proved both for finite-dimensional problems and for problems in function spaces, under suitable assumptions on the active set. A characterization of Bouligand and strong stationary points is obtained thereafter. Finally, based on the obtained first-order information, a trust-region algorithm is proposed for the solution of the optimization problems.

**Abstract**: We propose a nonsmooth continuum mechanical model for discontinuous shear thickening flow. The model obeys a formulation as energy minimization problem and its solution satisfies a Stokes type system with a nonsmooth constitute relation. Solutions have a free boundary at which the behavior of the fluid changes. We present Sobolev as well as H¨older regularity results and study the limit of the model as the viscosity in the shear thickened volume tends to infinity. A mixed problem formulation is discretized using finite elements and a semismooth Newton method is proposed for the solution of the resulting discrete system. Numerical problems for steady and unsteady shear thickening flows are presented and used to study the solution algorithm, properties of the flow and the free boundary. These numerical problems are motivated by recently reported experimental studies of dispersions with high particle-to-fluid volume fractions, which often show a sudden increase of viscosity at certain strain rates.

**Abstract**: We propose the use of the Kantorovich--Rubinstein norm from optimal transport in imaging problems. In particular, we discuss a variational regularization model endowed with a Kantorovich--Rubinstein discrepancy term and total variation regularization in the context of image denoising and cartoon-texture decomposition. We point out connections of this approach to several other recently proposed methods such as total generalized variation and norms capturing oscillating patterns. We also show that the respective optimization problem can be turned into a convex-concave saddle point problem with simple constraints and hence can be solved by standard tools. Numerical examples exhibit interesting features and favorable performance for denoising and cartoon-texture decomposition.

**Abstract**: We state and analyse one-shot methods in function space for the optimal control of nonlinear partial differential equations (PDEs) that can be formulated in terms of a fixed-point operator. A general convergence theorem is proved by generalizing the previously obtained results in finite dimensions. As application examples we consider two nonlinear elliptic model problems: the stationary solid fuel ignition model and the stationary viscous Burgers equation. For these problems we present a more detailed convergence analysis of the method. The resulting algorithms are computationally implemented in combination with an adaptive mesh refinement strategy, which leads to an improvement in the performance of the one-shot approach.

**Abstract**: We consider the bilevel optimisation approach proposed in [5] for learning the optimal parameters in a Total Variation (TV) denoising model featuring for multiple noise distributions. In applications, the use of databases (dictionaries) allows an accurate estimation of the parameters, but reflects in high computational costs due to the size of the databases and to the nonsmooth nature of the PDE constraints. To overcome this computational barrier we propose an optimisation algorithm that, by sampling dynamically from the set of constraints and using a quasi-Newton method, solves the problem accurately and in an efficient way.

**Abstract**: To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.

**Abstract**: We propose a nonsmooth PDE-constrained optimization approach for the determination of the correct noise model in total variation (TV) image denoising. An optimization problem for the determination of the weights corresponding to different types of noise distributions is stated and existence of an optimal solution is proved. A tailored regularization approach for the approximation of the optimal parameter values is proposed thereafter and its consistency studied. Additionally, the differentiability of the solution operator is proved and an optimality system characterizing the optimal solutions of each regularized problem is derived. The optimal parameter values are numerically computed by using a quasi-Newton method, together with semismooth Newton type algorithms for the solution of the TV-subproblems.

**Abstract**: We extend the applicability of Newton’s method for k-Fréchet differentiable operators in a Banach space setting by using a more flexible way of computing upper bounds on the inverses of the operators involved. In particular, we improve and extend the recent works by Ezquerro et al. (2012, 2013) [13,15]. Moreover, we illustrate our study with some numerical examples involving Hammerstein integral equations.

**Abstract**: We present a tighter local convergence result for Newton’s method under generalized conditions of Kantorovich type than the one given by Dennis and Schnabel (Numerical methods for unconstrained optimization and nonlinear equations. SIAM, Philadelphia, 1996) and by Ezquerro et al. (J Comput Appl Math 236:2246–2258, 2012) by using more precise majorizing functions and sequences. These improvements are obtained under the same computational cost as in the earlier studies. Numerical examples are also provided to show that the new convergence radii are larger and the new error bounds are tighter than the older ones.