Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications
DOI10.1080/01630563.2021.2001823zbMath1489.90109OpenAlexW3213693153WikidataQ115302042 ScholiaQ115302042MaRDI QIDQ5861980
Mohd. Zeeshan, Feeroz Babu, Qamrul Hasan Ansari
Publication date: 3 March 2022
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2021.2001823
subgradient methodRiemannian manifoldsGreenberg-Pierskalla quasi-subdifferentialquasi-convex optimization problemssum-minimization problems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Geodesics in global differential geometry (53C22) Existence theories for problems in abstract spaces (49J27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concepts and techniques of optimization on the sphere
- Subgradient method for convex feasibility on Riemannian manifolds
- Hilbertian convex feasibility problem: Convergence of projection methods
- Proximal point algorithm for inclusion problems in Hadamard manifolds with applications
- Decomposition into functions in the minimization problem
- Subgradient algorithm on Riemannian manifolds
- An incremental subgradient method on Riemannian manifolds
- On properties of supporting and quasi-supporting vectors
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Algorithms for the quasiconvex feasibility problem
- Regularization of proximal point algorithms in Hadamard manifolds
- Incremental Subgradient Methods for Nondifferentiable Optimization
- On the Convergence of Gradient Descent for Finding the Riemannian Center of Mass
- Fractional programming: The sum-of-ratios case
- Newton's method on Riemannian manifolds and a geometric model for the human spine
- Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
- Proximal Point Algorithm On Riemannian Manifolds
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Fractional Programming with Homogeneous Functions
- Path-based incremental target level algorithm on Riemannian manifolds
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Convergence and efficiency of subgradient methods for quasiconvex minimization
