A Smoothing SQP Framework for a Class of Composite $ Minimization over Polyhedron
The composite $L_q$ (0
The composite $L_q$ (0
An action integral is presented for Hamiltonian mechanics in canonical form with unilateral constraints and/or impacts. The transition conditions on generalized impulses and the energy are presented as variational inequalities, which are obtained by the application of discontinuous transversality conditions. The energetical behavior for elastic, plastic and blocking type impacts are analyzed. A general impact … Read more
In this paper, we consider the Forward–Backward proximal splitting algorithm to minimize the sum of two proper closed convex functions, one of which having a Lipschitz–continuous gradient and the other being partly smooth relatively to an active manifold $\mathcal{M}$. We propose a unified framework in which we show that the Forward–Backward (i) correctly identifies the … Read more
The paper is devoted to the study of a new class of optimal control problems governed by the classical Moreau sweeping process with the new feature that the polyhedral moving set is not fixed while controlled by time-dependent functions. The dynamics of such problems is described by dissipative non-Lipschitzian differential inclusions with state constraints of … Read more
We consider the problem of minimizing the sum of a smooth function $h$ with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function $P$ and a surjective linear map $\M$, with the proximal mappings of $\tau P$, $\tau > 0$, simple to compute. … Read more
We address the problem of minimizing objectives from the class of piecewise differentiable functions whose nonsmoothness can be encapsulated in the absolute value function. They possess local piecewise linear approximations with a discrepancy that can be bounded by a quadratic proximal term. This overestimating local model is continuous but generally nonconvex. It can be generated … Read more
Based on a preconditioned version of the randomized block-coordinate forward-backward algorithm recently proposed in [Combettes,Pesquet,2014], several variants of block-coordinate primal-dual algorithms are designed in order to solve a wide array of monotone inclusion problems. These methods rely on a sweep of blocks of variables which are activated at each iteration according to a random rule, … Read more
We study the convergence of general abstract descent methods applied to a lower semicontinuous nonconvex function f that satises 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 … Read more
We investigate the convergence of a forward-backward-forward proximal-type algorithm with inertial and memory effects when minimizing the sum of a nonsmooth function with a smooth one in the absence of convexity. The convergence is obtained provided an appropriate regularization of the objective satisfies the Kurdyka-\L{}ojasiewicz inequality, which is for instance fulfilled for semi-algebraic functions. Article … Read more
A line search algorithm for minimizing nonconvex and/or nonsmooth objective functions is presented. The algorithm is a hybrid between a standard Broyden–Fletcher–Goldfarb–Shanno (BFGS) and an adaptive gradient sampling (GS) method. The BFGS strategy is employed because it typically yields fast convergence to the vicinity of a stationary point, and together with the adaptive GS strategy … Read more