An inexact scalarization proximal point method for multiobjective quasiconvex minimization
From MaRDI portal
Publication:2675734
DOI10.1007/s10479-020-03622-8zbMath1495.90183OpenAlexW3024205498MaRDI QIDQ2675734
S. Cruzado, Erik Alex Papa Quiroz
Publication date: 26 September 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-020-03622-8
global convergencequasiconvex functionsPareto optimalityconvergence rateClarke subdifferentialproximal point methodmultiobjective minimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)
Related Items (3)
A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inexact proximal method for quasiconvex minimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Interior proximal methods for quasiconvex optimization
- An interior proximal method in vector optimization
- Handbook of generalized convexity and generalized monotonicity
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Theory of multiobjective optimization
- Subdifferential properties of quasiconvex and pseudoconvex functions: Unified approach
- Proximal point methods and nonconvex optimization
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Quasiconvex optimization and location theory
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Pseudomonotone operators and the Bregman proximal point algorithm
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Approximate proximal methods in vector optimization
- An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds
- Inexact proximal point algorithms and descent methods in optimization
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming
- On the proximal point method for equilibrium problems in Hilbert spaces
- Direct Multisearch for Multiobjective Optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Functional Analysis, Calculus of Variations and Optimal Control
- Clarke Subgradients of Stratifiable Functions
- New Proximal Point Algorithms for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Proximal Minimization Methods with Generalized Bregman Functions
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- An inexact algorithm with proximal distances for variational inequalities
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Multicriteria Optimization
- Proximal Methods in Vector Optimization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- A new accuracy criterion for approximate proximal point algorithms
This page was built for publication: An inexact scalarization proximal point method for multiobjective quasiconvex minimization
