A proximal point algorithm with quasi-distance in multi-objective optimization

DOI10.1007/S10957-016-1005-ZMaRDI QIDQ504811zbMATH OpenOpenAlexFDO

Authors Rogério A. Rocha, P. R. Oliveira, Ronaldo M. Gregório, Michael Souza

Publication date 17 January 2017

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-016-1005-z

zbMATH Keywords

multi-objective optimizationproximal point algorithmweak Pareto solutionquasi-distance

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Multi-objective and goal programming (90C29) Numerical methods based on nonlinear programming (49M37)

Recommendations

• Generalized proximal point algorithms for multiobjective optimization problems
• An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization
• Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
• A linear scalarization proximal point method for quasiconvex multiobjective minimization

Cites work

• scientific article; zbMATH DE number 1424327 (Why is no real title available?)
• A logarithmic-quadratic proximal point scalarization method for multiobjective programming
• A projected gradient method for vector optimization problems
• A proximal algorithm with quasi distance. Application to habit's formation
• An interior proximal method in vector optimization
• Applications of utility functions defined on quasi-metric spaces
• Approximate proximal methods in vector optimization
• Duality for multiobjective optimization via nonlinear Lagrangian functions
• Generalized proximal method for efficient solutions in vector optimization
• Generalized proximal point algorithms for multiobjective optimization problems
• Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
• Monotone Operators and the Proximal Point Algorithm
• Multiobjective linear programming. An introduction
• Nonsmooth sequential analysis in Asplund spaces
• Partial quasi-metrics
• Proximal Methods in Vector Optimization
• Recursive quasi-metric spaces.
• Steepest descent methods for multicriteria optimization.
• Theory of multiobjective optimization
• Variational Analysis
• Variational Analysis and Generalized Differentiation I

Cited in

(13)

• An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem
• An inexact proximal point method with quasi-distance for quasi-convex multiobjective optimization
• Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
• Computing optimal distances to Pareto sets of multi-objective optimization problems in asymmetric normed lattices
• A proximal point-type method for multicriteria optimization
• A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
• scientific article; zbMATH DE number 7400716 (Why is no real title available?)
• Hybrid proximal point algorithm for solution of convex multiobjective optimization problem over fixed point constraint
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming
• Coercivity and generalized proximal algorithms: application -- traveling around the world
• Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
• A proximal algorithm with quasi distance. Application to habit's formation
• A proximal gradient method with Bregman distance in multi-objective optimization

This page was built for publication: A proximal point algorithm with quasi-distance in multi-objective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504811)