Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
From MaRDI portal
Publication:2198534
multiobjective optimizationPareto optimalityquasiconvex functionHadamard manifoldsproximal point methods
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Consumer behavior, demand theory (91B42)
Recommendations
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
- scientific article; zbMATH DE number 6874131
- On the convergence of inexact proximal point algorithm on Hadamard manifolds
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds
- Inexact proximal point algorithms for inclusion problems on Hadamard manifolds
- Proximal point methods for solving mixed variational inequalities on the Hadamard manifolds
- Convergence analysis of inexact proximal point algorithms on Hadamard manifolds
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
Cites work
- scientific article; zbMATH DE number 4015993 (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 909255 (Why is no real title available?)
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A subgradient method for multiobjective optimization
- A subgradient method for multiobjective optimization on Riemannian manifolds
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- An interior proximal method in vector optimization
- Approximate proximal methods in vector optimization
- Computing Riemannian center of mass on Hadamard manifolds
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Direct Multisearch for Multiobjective Optimization
- Domains of positivity
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Linear cost share equilibria and the veto power of the grand coalition
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Local search proximal algorithms as decision dynamics with costs to move
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
- Monotone Operators and the Proximal Point Algorithm
- Multicriteria Optimization
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
- Proximal Methods in Vector Optimization
- Proximal Point Algorithm On Riemannian Manifolds
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- Proximal point methods for quasiconvex and convex functions with Bregman distances on Hadamard manifolds
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Steepest descent methods for multicriteria optimization.
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
Cited in
(26)- Inexact proximal point algorithm for quasiconvex optimization problems on Hadamard manifolds
- Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Mixed vector equilibrium-like problems on Hadamard manifolds: error bound analysis
- Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Extragradient algorithms for solving equilibrium problems on Hadamard manifolds
- Second-order optimality conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds
- Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
- Strongly geodesic preinvexity and strongly invariant η-monotonicity on Riemannian manifolds and its application
- Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds
- Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- scientific article; zbMATH DE number 6874131 (Why is no real title available?)
- Constraint qualifications for nonsmooth multiobjective programming problems with switching constraints on Hadamard manifolds
- Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
- Clarke subdifferential, Pareto-Clarke critical points and descent directions to multiobjective optimization on Hadamard manifolds
- Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity
This page was built for publication: Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198534)
