A proximal point-type method for multicriteria optimization
From MaRDI portal
Publication:741360
DOI10.1007/s11228-014-0279-2zbMath1296.90113OpenAlexW2048061283MaRDI QIDQ741360
Antoine Soubeyran, João Xavier da Cruz Neto, Glaydston C. Bento
Publication date: 11 September 2014
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-014-0279-2
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of global Riemannian geometry, including PDE methods; curvature restrictions (53C21) Convexity of real functions of several variables, generalizations (26B25)
Related Items
A proximal gradient splitting method for solving convex vector optimization problems, The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, Multiple reduced gradient method for multiobjective optimization problems, Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application, Proximal point method for vector optimization on Hadamard manifolds, Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm, Convergence rates of the stochastic alternating algorithm for bi-objective optimization, Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds, Nonmonotone gradient methods for vector optimization with a portfolio optimization application, On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds, A scalarization proximal point method for quasiconvex multiobjective minimization, Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds, The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, Proximal point method for a special class of nonconvex multiobjective optimization functions, A linear scalarization proximal point method for quasiconvex multiobjective minimization, A strongly convergent proximal point method for vector optimization, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Proximal point algorithm for differentiable quasi-convex multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A subgradient method for multiobjective optimization on Riemannian manifolds
- Linear cost share equilibria and the veto power of the grand coalition
- Finite convergence of the proximal point algorithm for variational inequality problems
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- An interior proximal method in vector optimization
- Finite termination of the proximal point algorithm
- On gradients of functions definable in o-minimal structures
- Steepest descent methods for multicriteria optimization.
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- Geometric categories and o-minimal structures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Weak \(\psi \)-sharp minima in vector optimization problems
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Approximate proximal methods in vector optimization
- A subgradient method for multiobjective optimization
- Inexact projected gradient method for vector optimization
- On the convergence of the projected gradient method for vector optimization
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Minima on Riemannian Manifolds
- Clarke Subgradients of Stratifiable Functions
- Newton's Method for Multiobjective Optimization
- Variational Analysis
- Variational Analysis and Generalized Differentiation I
- Proximal Methods in Vector Optimization
- On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems
- Finite termination of the proximal point method for convex functions on Hadamard manifolds
