Efficient computation of capillary-gravity generalized solitary waves

This paper is devoted to the computation of capillary-gravity solitary waves of the irrotational incompressible Euler equations with free surface. The numerical study is a continuation of a previous work in several points: an alternative formulation of the Babenko-type equation for the wave profiles, a detailed description of both the numerical resolution and the analysis of the internal flow structure under a solitary wave. The numerical code used in this study is provided in open source for those interested readers.Comment: 26 pages, 21 figures, 2 tables, 43 references. Other author's papers can be downloaded at http://www.denys-dutykh.com/. arXiv admin note: substantial text overlap with arXiv:1411.551

Global rates of convergence for nonconvex optimization on manifolds

We consider the minimization of a cost function $f$ on a manifold $M$ using Riemannian gradient descent and Riemannian trust regions (RTR). We focus on satisfying necessary optimality conditions within a tolerance $\varepsilon$. Specifically, we show that, under Lipschitz-type assumptions on the pullbacks of $f$ to the tangent spaces of $M$, both of these algorithms produce points with Riemannian gradient smaller than $\varepsilon$ in $O(1/\varepsilon^2)$ iterations. Furthermore, RTR returns a point where also the Riemannian Hessian's least eigenvalue is larger than $-\varepsilon$ in $O(1/\varepsilon^3)$ iterations. There are no assumptions on initialization. The rates match their (sharp) unconstrained counterparts as a function of the accuracy $\varepsilon$ (up to constants) and hence are sharp in that sense. These are the first deterministic results for global rates of convergence to approximate first- and second-order Karush-Kuhn-Tucker points on manifolds. They apply in particular for optimization constrained to compact submanifolds of $\mathbb{R}^n$, under simpler assumptions.Comment: 33 pages, IMA Journal of Numerical Analysis, 201

Nonlinear Parabolic Equations arising in Mathematical Finance

This survey paper is focused on qualitative and numerical analyses of fully nonlinear partial differential equations of parabolic type arising in financial mathematics. The main purpose is to review various non-linear extensions of the classical Black-Scholes theory for pricing financial instruments, as well as models of stochastic dynamic portfolio optimization leading to the Hamilton-Jacobi-Bellman (HJB) equation. After suitable transformations, both problems can be represented by solutions to nonlinear parabolic equations. Qualitative analysis will be focused on issues concerning the existence and uniqueness of solutions. In the numerical part we discuss a stable finite-volume and finite difference schemes for solving fully nonlinear parabolic equations.Comment: arXiv admin note: substantial text overlap with arXiv:1603.0387

A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions

In a general Hilbert framework, we consider continuous gradient-like dynamical systems for constrained multiobjective optimization involving non-smooth convex objective functions. Our approach is in the line of a previous work where was considered the case of convex di erentiable objective functions. Based on the Yosida regularization of the subdi erential operators involved in the system, we obtain the existence of strong global trajectories. We prove a descent property for each objective function, and the convergence of trajectories to weak Pareto minima. This approach provides a dynamical endogenous weighting of the objective functions. Applications are given to cooperative games, inverse problems, and numerical multiobjective optimization

Splitting methods with variable metric for KL functions

We study the convergence of general abstract descent methods applied to a lower semicontinuous nonconvex function f that satisfies the Kurdyka-Lojasiewicz inequality in a Hilbert space. We prove that any precompact sequence converges to a critical point of f and obtain new convergence rates both for the values and the iterates. The analysis covers alternating versions of the forward-backward method with variable metric and relative errors. As an example, a nonsmooth and nonconvex version of the Levenberg-Marquardt algorithm is detailled