Logarithmic quasi-distance proximal point scalarization method for multi-objective programming

DOI10.1016/J.AMC.2015.10.065MaRDI QIDQ668555zbMATH OpenOpenAlexFDO

Authors Rogério Azevedo Rocha, P. R. Oliveira, Ronaldo Malheiros Gregório, Michael Souza

Publication date 19 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2015.10.065

zbMATH Keywords

multi-objective programmingproximal point algorithmscalar representationquasi-distance

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)

Recommendations

• A logarithmic-quadratic proximal point scalarization method for multiobjective programming
• Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
• A proximal point algorithm with quasi-distance in multi-objective optimization
• A scalarization proximal point method for quasiconvex multiobjective minimization
• An inexact scalarization proximal point method for multiobjective quasiconvex minimization

Cites work

• scientific article; zbMATH DE number 5002607 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
• A logarithmic-quadratic proximal method for variational inequalities
• A logarithmic-quadratic proximal point scalarization method for multiobjective programming
• A primal-dual proximal point algorithm for constrained convex programs
• A proximal-like algorithm for a class of nonconvex programming
• A survey of recent developments in multiobjective optimization
• An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
• An interior proximal method in vector optimization
• Applications of utility functions defined on quasi-metric spaces
• Approximate proximal methods in vector optimization
• Asymptotic analysis in convex composite multiobjective optimization problems
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Generalized viscosity approximation methods in multiobjective optimization problems
• Interior proximal methods for quasiconvex optimization
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Monotone Operators and the Proximal Point Algorithm
• Nonlinear multiobjective optimization
• Nonsmooth sequential analysis in Asplund spaces
• Pareto optimality, game theory and equilibria
• Partial quasi-metrics
• Proximal Methods in Vector Optimization
• Recursive quasi-metric spaces.
• Steepest descent methods for multicriteria optimization.
• Variational Analysis
• Variational methods in partially ordered spaces

Cited in

(5)

• Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
• A logarithmic-quadratic proximal point scalarization method for multiobjective programming
• Logarithmic Quasi-distance Proximal Point Scalarization Method for Multi-Objective Programming
• Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
• A proximal point algorithm with quasi-distance in multi-objective optimization

This page was built for publication: Logarithmic quasi-distance proximal point scalarization method for multi-objective programming

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