Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
From MaRDI portal
Publication:668555
DOI10.1016/j.amc.2015.10.065zbMath1410.90182OpenAlexW1515023923MaRDI QIDQ668555
Ronaldo Malheiros Gregório, Rogério Azevedo Rocha, Paulo Roberto Oliveira, 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
Related Items (2)
Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds ⋮ A proximal point algorithm with quasi-distance in multi-objective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Interior proximal methods for quasiconvex optimization
- Generalized viscosity approximation methods in multiobjective optimization problems
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- An interior proximal method in vector optimization
- Partial quasi-metrics
- Pareto optimality, game theory and equilibria
- A logarithmic-quadratic proximal method for variational inequalities
- Nonlinear multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- Applications of utility functions defined on quasi-metric spaces
- Variational methods in partially ordered spaces
- Recursive quasi-metric spaces.
- A primal-dual proximal point algorithm for constrained convex programs
- Asymptotic analysis in convex composite multiobjective optimization problems
- Approximate proximal methods in vector optimization
- A survey of recent developments in multiobjective optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Nonsmooth sequential analysis in Asplund spaces
- Proximal Methods in Vector Optimization
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
This page was built for publication: Logarithmic quasi-distance proximal point scalarization method for multi-objective programming