Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
DOI10.1007/s10957-020-01725-7zbMath1447.49047OpenAlexW3046702492MaRDI QIDQ2198534
Nancy Baygorrea Cusihuallpa, Erik Alex Papa Quiroz, Nelson F. Maculan
Publication date: 10 September 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01725-7
multiobjective optimizationquasiconvex functionPareto optimalityHadamard manifoldsproximal point methods
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Consumer behavior, demand theory (91B42)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Linear cost share equilibria and the veto power of the grand coalition
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Local search proximal algorithms as decision dynamics with costs to move
- An interior proximal method in vector optimization
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Steepest descent methods for multicriteria optimization.
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
- On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- Computing Riemannian center of mass on Hadamard manifolds
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Approximate proximal methods in vector optimization
- A subgradient method for multiobjective optimization
- An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
- Direct Multisearch for Multiobjective Optimization
- Monotone Operators and the Proximal Point Algorithm
- Proximal Point Algorithm On Riemannian Manifolds
- Multicriteria Optimization
- Proximal Methods in Vector Optimization
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- Domains of positivity
This page was built for publication: Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds