Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
From MaRDI portal
Publication:668555
DOI10.1016/J.AMC.2015.10.065zbMATH Open1410.90182OpenAlexW1515023923MaRDI QIDQ668555FDOQ668555
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
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
- Variational Analysis
- Nonlinear multiobjective optimization
- Variational methods in partially ordered spaces
- Monotone Operators and the Proximal Point Algorithm
- Nonsmooth sequential analysis in Asplund spaces
- Title not available (Why is that?)
- A logarithmic-quadratic proximal method for variational inequalities
- Approximate proximal methods in vector optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Partial quasi-metrics
- A survey of recent developments in multiobjective optimization
- Pareto optimality, game theory and equilibria
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Asymptotic analysis in convex composite multiobjective optimization problems
- Proximal Methods in Vector Optimization
- An interior proximal method in vector optimization
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- Steepest descent methods for multicriteria optimization.
- A proximal-like algorithm for a class of nonconvex programming
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Interior proximal methods for quasiconvex optimization
- A logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Applications of utility functions defined on quasi-metric spaces
- Recursive quasi-metric spaces.
- Generalized viscosity approximation methods in multiobjective optimization problems
- A primal-dual proximal point algorithm for constrained convex programs
- Title not available (Why is that?)
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
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
- Logarithmic Quasi-distance Proximal Point Scalarization Method for Multi-Objective Programming
- 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)
