The quadratic optimization-free (QO-free) method is a class of powerful and effective algorithms for solving nonlinearly constrained optimization problems in Euclidean spaces. The aim of the present work is to extend this method to solve optimization problems on manifolds with additional equality and inequality constraints. We first present a specific algorithm in the manifold setting. At each iteration, three linear systems sharing a common linear operator are solved to determine the master search direction. In addition, a higher-order correction direction is obtained by solving a reduced linear least squares subproblem to circumvent the Maratos effect which is assumed not to arise in existing related literature. A Riemannian arc search is then performed within the tangent space of the current iterate to generate the new iterate. Under appropriate assumptions, we establish the global and strong convergence of the proposed method. Moreover, we prove that the unit step size will eventually be accepted by the arc search, upon which the superlinear convergence of the algorithm is established. Finally, numerical results demonstrate that the proposed method is very competitive compared with other existing approaches.
This study extends the stabilized SQP framework from Euclidean spaces to Riemannian manifolds and proves that the generated sequence has an accumulation point that is a Karush--Kuhn--Tucker (KKT) point, an approximate KKT (AKKT) point, or a stationary point of an associated feasibility problem.
For solving nonconvex equality-constrained optimization problems, a recent Gradient-Eigenstep Algorithm by Goyens et al.~is an iteration-efficient approach, based on minimizing Fletcher's augmented Lagrangian function, for finding an approximate second-order stationary point from an arbitrary starting point. In this pa...
F. Curtis, Ling-Jun Guo, Daniel P. Robinson· 0 citations
A globally convergent regularized Newton method with positive definite regularization for solving nonsmooth optimization problems that replaces the identity matrix in traditional algorithms with a general positive-definite symmetric matrix to regularize the generalized Hessian.
This paper proposes a general line-search Newton framework for unconstrained optimization that avoids repeated Hessian regularization by exploiting the Newton direction only when it is well-defined and suitable and provides the first Newton-type algorithm together with a comprehensive convergence analysis for this impo...
We study a proximal point type method for approximating solutions to equilibrium problems generated by pseudomonotone and strongly quasiconvex bifunctions over Hadamard manifolds, that is complete simply connected Riemannian manifolds of nonpositive sectional curvature. Next to the usual proximal step, the method we co...
Luisa Marie Després, Nicholas Pischke· 0 citations
In this thesis, two novel iterative algorithms are proposed and analyzed to obtain a common solution to generalized nonlinear variational inequality, equilibrium, and fixed-point problems for nonexpansive mappings in real Hilbert spaces. The first algorithm is developed to approximate a common solution of these three c...
Jackson Kalule· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.