The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
From MaRDI portal
Publication:4637508
Recommendations
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
- Inexact proximal point algorithm for multiobjective optimization
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A proximal point-type method for multicriteria optimization
Cites work
- scientific article; zbMATH DE number 4133840 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A projected gradient method for vector optimization problems
- A proximal algorithm with quasi distance. Application to habit's formation
- A proximal point-type method for multicriteria optimization
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A steepest descent method for vector optimization
- A subgradient method for multiobjective optimization
- A subgradient method for vector optimization problems
- ASMO
- An Adaptive Scalarization Method in Multiobjective Optimization
- An interior proximal method in vector optimization
- Approximate proximal methods in vector optimization
- Clarke critical values of subanalytic Lipschitz continuous functions
- Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS.
- Compromise solutions and estimation of the noninferior set
- Convex vector functions and their subdifferential
- Direct Multisearch for Multiobjective Optimization
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Extended VIKOR method in comparison with outranking methods
- Generalized Gradients and Applications
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- Hybrid approximate proximal algorithms for efficient solutions in vector optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Monotone Operators and the Proximal Point Algorithm
- Newton's method for multiobjective optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On the Clarke subdifferential of the distance function of a closed set
- On the choice of parameters for the weighting method in vector optimization
- On the convergence of the projected gradient method for vector optimization
- Proximal Methods in Vector Optimization
- Proximité et dualité dans un espace hilbertien
- Scalarization in vector optimization
- Some remarks on proximal point algorithm in scalar and vectorial cases
- Steepest descent methods for multicriteria optimization.
- Subdifferentials of nonconvex vector-valued functions
- The power of compromise. Reference point methods and approximation in multicriteria optimization
- Variational methods in partially ordered spaces
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
Cited in
(24)- An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A line search technique for a class of multi-objective optimization problems using subgradient
- An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
- General descent method using w-distance. Application to emergence of habits following worthwhile moves
- A proximal gradient splitting method for solving convex vector optimization problems
- Isotonicity of the proximity operator and mixed variational inequalities in Hilbert spaces
- An inexact proximal point method for quasiconvex multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Abstract regularized equilibria: application to Becker's household behavior theory
- Isotonicity of the metric projection with respect to the mutually dual orders and complementarity problems
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Conditional gradient method for multiobjective optimization
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- A strongly convergent proximal point method for vector optimization
- Combined gradient methods for multiobjective optimization
- Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases
- The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- Inexact proximal point algorithm for multiobjective optimization
- Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones
This page was built for publication: The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637508)
