A proximal algorithm for constrained multiobjective minimization with quasiconvex functions
From MaRDI portal
Cites work
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- A proximal gradient splitting method for solving convex vector optimization problems
- A proximal multiplier method for separable convex minimization
- A proximal point-type method for multicriteria optimization
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- An inexact algorithm with proximal distances for variational inequalities
- An inexact proximal method for quasiconvex minimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- An interior proximal method in vector optimization
- Approximate iterations in Bregman-function-based proximal algorithms
- Approximate proximal methods in vector optimization
- Convergence of Proximal-Like Algorithms
- Double-regularization proximal methods, with complementarity applications
- Fractional Programming with Homogeneous Functions
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Inertial forward–backward methods for solving vector optimization problems
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
- Inexact proximal point methods for variational inequality problems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interior projection-like methods for monotone variational inequalities
- Interior proximal methods for quasiconvex optimization
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- Microeconomic theory
- Monotone Operators and the Proximal Point Algorithm
- Multicriteria decision making
- Multicriteria Optimization
- Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets
- On inexact generalized proximal methods with a weakened error tolerance criterion
- On strongly quasiconvex functions: existence results and proximal point algorithms
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the proximal point method for equilibrium problems in Hilbert spaces
- Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm
- Proximal Methods in Vector Optimization
- Proximal Minimization Methods with Generalized Bregman Functions
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Splitting algorithms, modern operator theory, and applications. Based on the workshop on splitting algorithms, modern operator theory, and applications, Oaxaca, Mexico, September 17--22, 2017. Dedicated to the memory of Jonathan M. Borwein
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Transformation of quasiconvex functions to eliminate local minima
This page was built for publication: A proximal algorithm for constrained multiobjective minimization with quasiconvex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319247)
