A proximal point-type method for multicriteria optimization
From MaRDI portal
Publication:741360
DOI10.1007/s11228-014-0279-2zbMath1296.90113MaRDI 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
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
53C21: Methods of global Riemannian geometry, including PDE methods; curvature restrictions
26B25: Convexity of real functions of several variables, generalizations
Related Items
The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, A proximal gradient splitting method for solving convex vector optimization problems, The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, Proximal point algorithm for differentiable quasi-convex multiobjective optimization, Convergence rates of the stochastic alternating algorithm for bi-objective optimization, Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds, Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions, A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application, A scalarization proximal point method for quasiconvex multiobjective minimization, Multiple reduced gradient method for multiobjective optimization problems, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, 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, Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds, Proximal point method for a special class of nonconvex multiobjective optimization functions, A strongly convergent proximal point method for vector optimization, A linear scalarization proximal point method for quasiconvex multiobjective minimization, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Proximal point method for vector optimization on Hadamard manifolds, Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
