Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds
From MaRDI portal
Publication:5080505
DOI10.1137/20M1370173OpenAlexW3086070280WikidataQ115246877 ScholiaQ115246877MaRDI QIDQ5080505
Takayuki Okuno, Akiko Takeda, Mitsuaki Obara
Publication date: 31 May 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.07153
nonlinear optimizationRiemannian manifoldsRiemannian optimizationsequential quadratic optimization\(\ell_1\) penalty function
Related Items (2)
Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization ⋮ First- and second-order analysis for optimization problems with manifold-valued constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an inexact trust-region SQP-filter method for constrained nonlinear optimization
- A globally convergent method for nonlinear programming
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- A robust sequential quadratic programming method
- On the superlinear local convergence of a filter-SQP method
- Nonnegative low rank matrix approximation for nonnegative matrices
- An efficient method for non-negative low-rank completion
- Simple algorithms for optimization on Riemannian manifolds with constraints
- Riemannian conjugate gradient methods with inverse retraction
- Damped Newton's method on Riemannian manifolds
- A brief introduction to manifold optimization
- Cholesky QR-based retraction on the generalized Stiefel manifold
- An SQP-type algorithm for nonlinear second-order cone programs
- Low-Rank Matrix Completion by Riemannian Optimization
- Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
- Manopt, a Matlab toolbox for optimization on manifolds
- An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization
- A Broyden Class of Quasi-Newton Methods for Riemannian Optimization
- A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
- Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver
- An Inexact SQP Method for Equality Constrained Optimization
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
- A successive quadratic programming algorithm with global and superlinear convergence properties
- Trust Region Methods
- A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- A stabilized SQP method: global convergence
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global rates of convergence for nonconvex optimization on manifolds
- An SQP Method for Equality Constrained Optimization on Hilbert Manifolds
- Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
- Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds
- Stochastic Gradient Descent on Riemannian Manifolds
- A Globally Convergent Stabilized SQP Method
- Nonlinear programming without a penalty function.
This page was built for publication: Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds
