Related papers: Newton-like dynamics associated to nonconvex optim…
In optimization the duality gap between the primal and the dual problems is a measure of the suboptimality of any primal-dual point. In classical mechanics the equations of motion of a system can be derived from the Hamiltonian function,…
We examine in the context of general relativity the dynamics of a spatially flat Robertson-Walker universe filled with a classical minimally coupled scalar field \phi of exponential potential ~ e^{-\mu\phi} plus pressureless baryonic…
Nonconvex-nonconcave minimax optimization has gained widespread interest over the last decade. However, most existing works focus on variants of gradient descent-ascent (GDA) algorithms, which are only applicable to smooth nonconvex-concave…
Nonlinearly constrained nonconvex and nonsmooth optimization models play an increasingly important role in machine learning, statistics and data analytics. In this paper, based on the augmented Lagrangian function we introduce a flexible…
We introduce a notion of inexact model of a convex objective function, which allows for errors both in the function and in its gradient. For this situation, a gradient method with an adaptive adjustment of some parameters of the model is…
In this work, we approach the minimization of a continuously differentiable convex function under linear equality constraints by a second-order dynamical system with asymptotically vanishing damping term. The system is formulated in terms…
In this paper, we implement a generalised pseudo-Newtonian potential to study the off-equatorial orbits inclined at a certain angle with the equatorial plane around Schwarzschild and Kerr-like compact object primaries surrounded by a…
Properties of first-order Sobolev-type spaces on abstract metric measure spaces, so-called Newtonian spaces, based on quasi-Banach function lattices are investigated. The set of all weak upper gradients of a Newtonian function is of…
We propose a novel and efficient lifting approach for the optimal control of rigid-body systems with contacts to improve the convergence properties of Newton-type methods. To relax the high nonlinearity, we consider the state, acceleration,…
We study the convergence properties of a general inertial first-order proximal splitting algorithm for solving nonconvex nonsmooth optimization problems. Using the Kurdyka--\L ojaziewicz (KL) inequality we establish new convergence rates…
We consider a composite optimization problem where the sum of a continuously differentiable and a merely lower semicontinuous function has to be minimized. The proximal gradient algorithm is the classical method for solving such a problem…
Optimization algorithms can see their local convergence rates deteriorate when the Hessian at the optimum is singular. These singularities are inescapable when the optima are non-isolated. Yet, under the right circumstances, several…
We introduce a novel algorithm for solving learning problems where both the loss function and the regularizer are non-convex but belong to the class of difference of convex (DC) functions. Our contribution is a new general purpose proximal…
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
This paper addresses a class of nonsmooth and nonconvex optimization problems defined on complete Riemannian manifolds. The objective function has a composite structure, combining convex, differentiable, and lower semicontinuous terms,…
We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…
The usual approach to developing and analyzing first-order methods for non-smooth (stochastic or deterministic) convex optimization assumes that the objective function is uniformly Lipschitz continuous with parameter $M_f$. However, in many…
The dynamics of the pseudo-Newtonian restricted four-body problem has been studied in the present paper, where the primaries have equal masses. The parametric variation of the existence as well as the position of the libration points are…
The main challenge of nonconvex optimization is to find a global optimum, or at least to avoid ``bad'' local minima and meaningless stationary points. We study here the extent to which algorithms, as opposed to optimization models and…
The task of inducing, via continuous static state-feedback control, an asymptotically stable heteroclinic orbit in a nonlinear control system is considered in this paper. The main motivation comes from the problem of ensuring convergence to…