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
Authors: G. C. Bento, J. X. da Cruz Neto, Paulo Sérgio M. Santos 
Publication date: 22 November 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0305-9
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
Riemannian manifoldsPareto optimalitymulticriteria optimizationquasi-convexitysteepest descentquasi-Fejér convergence
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Title not available (Why is that?)
- Sectional curvatures in nonlinear optimization
- Vector Optimization
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- Title not available (Why is that?)
- Subgradient method for convex feasibility on Riemannian manifolds
- Title not available (Why is that?)
- Monotone and accretive vector fields on Riemannian manifolds
- Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
- Locally Geodesically Quasiconvex Functions on Complete Riemannian Manifolds
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Proximal Methods in Vector Optimization
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- Inexact projected gradient method for vector optimization
- On the convergence of the projected gradient method for vector optimization
- Newton's method for multiobjective optimization
- Quasiconvex optimization and location theory
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- On the choice of parameters for the weighting method in vector optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
Cited In (19)
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- An inexact proximal point method for quasiconvex multiobjective optimization
- A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
- Inexact proximal point algorithm for quasiconvex optimization problems on Hadamard manifolds
- Multiobjective BFGS method for optimization on Riemannian manifolds
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proximal point method for vector optimization on Hadamard manifolds
- An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Semivectorial bilevel optimization on Riemannian manifolds
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
- A trust region method for solving multicriteria optimization problems on Riemannian manifolds
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- Reduced Jacobian method
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)
