The Gradient Projection Method Along Geodesics
From MaRDI portal
Cited in
(69)- Lie-group-type neural system learning by manifold retractions
- On the superlinear convergence of Newton's method on Riemannian manifolds
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- Nonlinear coordinate representations of smooth optimization problems
- Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
- A Riemannian steepest descent approach over the inhomogeneous symplectic group: application to the averaging of linear optical systems
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds
- A combined penalty function and gradient projection method for nonlinear programming
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
- Linearly constrained global optimization and stochastic differential equations
- Nonlinear optimal feedback control for lunar module soft landing
- Convergence analysis of a global optimization algorithm using stochastic differential equations
- On the Second-Order Sufficiency Conditions
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Optimization methods on Riemannian manifolds via extremum seeking algorithms
- On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds
- An exact penalty function based on the projection matrix
- A class of primal affine scaling algorithms
- Multi-step-length gradient iterative algorithm for equation-error type models
- Geodesic convexity in nonlinear optimization
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- Rayleigh quotient iteration, cubic convergence, and second covariant derivative
- Null space gradient flows for constrained optimization with applications to shape optimization
- Riemannian optimization and multidisciplinary design optimization
- Minimizing a differentiable function over a differential manifold
- Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- Gradient projection and conditional gradient methods for constrained nonconvex minimization
- Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
- Minimization methods with constraints
- Adaptive regularization with cubics on manifolds
- An inexact semismooth Newton method on Riemannian manifolds with application to duality-based total variation denoising
- Optimization over geodesics for exact principal geodesic analysis
- A globally optimal tri-vector method to solve an ill-posed linear system
- Proximal point method for quasiconvex functions in Riemannian manifolds
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- A Broyden class of quasi-Newton methods for Riemannian optimization
- Gradient method for optimization on Riemannian manifolds with lower bounded curvature
- Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
- Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
- Regularizing Orientation Estimation in Cryogenic Electron Microscopy Three-Dimensional Map Refinement through Measure-Based Lifting over Riemannian Manifolds
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
- An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds
- The gradient projection method with Armijo's step size on manifolds
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds
- Convex optimization on Riemannian manifolds
- Point-Process Principal Components Analysis via Geometric Optimization
- Minimum problems on differentiable manifolds
- Gradient projection method on matrix manifolds
- Low-rank retractions: a survey and new results
- Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization
- Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
- Smooth connectivity in real algebraic varieties
- A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems
- Extending the applicability of Newton's method on Lie groups
- On the Pironneau-Polak method of centers
- Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds
- Hadamard integral inequality for the class of semi-harmonically convex functions
- scientific article; zbMATH DE number 7299944 (Why is no real title available?)
- Riemannian multigrid line search for low-rank problems
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- Computing Riemannian center of mass on Hadamard manifolds
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- An SQP method for equality constrained optimization on Hilbert manifolds
- First order methods for optimization on Riemannian manifolds
- Global optimization of robust chance constrained problems
This page was built for publication: The Gradient Projection Method Along Geodesics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668622)
