An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
From MaRDI portal
Publication:382906
DOI10.1007/S10957-013-0305-9zbMATH Open1295.90067OpenAlexW2084127566WikidataQ115382574 ScholiaQ115382574MaRDI QIDQ382906FDOQ382906
Recommendations
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- A subgradient method for multiobjective optimization on Riemannian manifolds
- An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
Cites work
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 3490676 (Why is no real title available?)
- scientific article; zbMATH DE number 3511136 (Why is no real title available?)
- scientific article; zbMATH DE number 1282147 (Why is no real title available?)
- scientific article; zbMATH DE number 681023 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- A projected gradient method for vector optimization problems
- A steepest descent method for vector optimization
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Inexact projected gradient method for vector optimization
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Locally Geodesically Quasiconvex Functions on Complete Riemannian Manifolds
- Monotone and accretive vector fields on Riemannian manifolds
- Newton's method for multiobjective optimization
- On the choice of parameters for the weighting method in vector optimization
- On the convergence of the projected gradient method for vector optimization
- Proximal Methods in Vector Optimization
- Quasiconvex optimization and location theory
- Sectional curvatures in nonlinear optimization
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- Steepest descent methods for multicriteria optimization.
- Subgradient method for convex feasibility on Riemannian manifolds
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Vector Optimization
Cited in
(19)- A subgradient method for multiobjective optimization on Riemannian manifolds
- Inexact proximal point algorithm for quasiconvex optimization problems on Hadamard manifolds
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
- scientific article; zbMATH DE number 7021575 (Why is no real title available?)
- scientific article; zbMATH DE number 2036171 (Why is no real title available?)
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- An inexact proximal point method for quasiconvex multiobjective optimization
- Proximal point method for vector optimization on Hadamard manifolds
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- Reduced Jacobian method
- Semivectorial bilevel optimization on Riemannian manifolds
- An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
- A trust region method for solving multicriteria optimization problems on Riemannian manifolds
- Multiobjective BFGS method for optimization on Riemannian manifolds
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
This page was built for publication: An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q382906)
